Premium
TWO‐ AND THREE‐STAGE FLOWSHOP SCHEDULING WITH NO‐WAIT IN PROCESS
Author(s) -
CHENG T. C. EDWIN,
SRISKANDARAJAH CHELLIAH,
WANG GUOQING
Publication year - 2000
Publication title -
production and operations management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.279
H-Index - 110
eISSN - 1937-5956
pISSN - 1059-1478
DOI - 10.1111/j.1937-5956.2000.tb00464.x
Subject(s) - job shop scheduling , computer science , scheduling (production processes) , mathematical optimization , stage (stratigraphy) , time complexity , process (computing) , algorithm , mathematics , schedule , paleontology , biology , operating system
In this paper we study the time complexities of some two‐ and three‐stage no‐wait flowshop makespan scheduling problems where, in some stage, all the jobs require a constant processing time and the stage may consist of parallel identical machines. Polynomial time algorithms are presented for certain problems, while several others are proved to be strongly NP‐complete.