Two-stage flexible flow shop scheduling subject to fixed job sequences

F. J. Hwang*, Miao-Tsong Lin

*Corresponding author for this work

研究成果: Article同行評審

4 引文 斯高帕斯(Scopus)

摘要

This paper investigates the scheduling problem in a two-stage flexible flow shop, which consists of m stage-1 parallel dedicated machines and a stage-2 bottleneck machine, subject to the condition that n l jobs per type l∈1,..., m are processed in a fixed sequence. Four regular performance metrics, including the total completion time, the maximum lateness, the total tardiness, and the number of tardy jobs, are considered. For each considered objective function, we aim to determine an optimal interleaving processing sequence of all jobs coupled with their starting times on the stage-2 bottleneck machine. The problem under study is proved to be strongly NP-hard. An O(m 2 Π l=1 m n l 2) dynamic programming algorithm coupled with numerical experiments is presented.

原文English
頁(從 - 到)506-515
頁數10
期刊Journal of the Operational Research Society
67
發行號3
DOIs
出版狀態Published - 三月 2016

指紋 深入研究「Two-stage flexible flow shop scheduling subject to fixed job sequences」主題。共同形成了獨特的指紋。

引用此