Makespan Distributions in Flow Shops with Multiple Processors

多工連續型工作站之總作業時間跨距分佈問題研究

Wei Wang ； John L. Hunsucker

《工業工程學刊》 21卷3期 (2004/05) Pp. 242-250

https://doi.org/10.29977/JCIIE.200405.0004

摘要

本論文主要研究多工連續型工作站之總作業時間跨距分佈問題(FSMP)，FSMP問題的特徵在於n個加工製程通過m個單一或多重的連續型工作站，而最小總作業時間跨距FSMP問題常需大量且複雜繁瑣的運算，所以研究總作業時間跨距分佈對FSMP問題求解與後續研究有其重要性存在。而本研究的成果對於FSMP作業時間跨距的問題有更深入的研究成果，以利後續研究發展。

關鍵字

排程 ； 連續型工作站 ； 總作業時間跨距 ； 分佈啓發式解法

並列摘要

The makespan distributions in a flow shop with multiple processors(FSMP)are investigated in this study. The FSMP problem is characterized as the processing of n jobs through an m stage flow shop, where there exists one or more processors at each stage. Since it is known that the minimum makespan FSMP problem is computationally explosive, it was necessary to investigate the distribution of makespans in FSMP in order to provide guidance to the FSMP research. Results of this study may help gain a better understanding of the FSMP makespan problem.

並列關鍵字

Scheduling ； Flow shop ； Makespan ； Distribution ； Heuristic

參考文獻

Brah, S. A.,J. L. Hunsucker, J.,Shah(1991).Mathematical modeling of scheduling problems.Journal of Information & Optimization Sciences.12(1),113-137.

Brah, S. A.,J. L. Hunsucker(1991).Branch and bound algorithm for the flow shop with multiple processors.European Journal of Operational Research.51,88-99.

Campbell, H. G.,R. A. Dudek,A. Richard,M. L. Smith(1970).A heuristic algorithm for the n job, m machine sequencing problem.Management Science.16,630-637.

Dannenbring, D. G.(1977).An evaluation of flow shop sequencing heuristics.Management Science.23,1174-1182.

Deal, D. E.,J. L. Hunsucker(1991).The two-stage flowshop scheduling problem with m machines at each stage.Journal of Information & Optimization Sciences.12,407-417.