Fabrication and assembly scheduling in a two-machine flowshop

Miao-Tsong Lin, T. C E Cheng*

*Corresponding author for this work

研究成果: Article

25 引文 斯高帕斯(Scopus)

摘要

This paper considers a fabrication scheduling problem to minimize the makespan in a two-machine flowshop. Each job has a unique component and a common component to be processed on the first machine. On machine 1, the common components of the jobs are grouped into batches for processing with a setup cost incurred whenever a batch is formed. A job is ready for its assembly operation on the second machine if both its unique and common components are finished on machine 1. The problems with batch availability and item availability are known as NP-hard. In this paper, we give proofs for the strong NP-hardness of the two problems. The results suggest that it is very unlikely to develop polynomial- or pseudo-polynomial-time algorithm for finding exact solutions for the two problems.

原文English
頁(從 - 到)1015-1020
頁數6
期刊IIE Transactions (Institute of Industrial Engineers)
34
發行號11
DOIs
出版狀態Published - 1 十一月 2002

指紋 深入研究「Fabrication and assembly scheduling in a two-machine flowshop」主題。共同形成了獨特的指紋。

  • 引用此