Production and Operations Management 2000

TWO‐ AND THREE‐STAGE FLOWSHOP SCHEDULING WITH NO‐WAIT IN PROCESS

T. C. E. Cheng¹; Chelliah Sriskandarajah²; Guoqing Wang^1,3

¹ Hong Kong Polytechnic University · ² The University of Texas at Dallas · ³ Jinan University

Abstract

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.

DOI

10.1111/j.1937-5956.2000.tb00464.x

Sources

openalex

Cite

APA 7 MLA 9 Chicago (author–date) Harvard Elsevier Harvard (JFE, JBF…) The Accounting Review Academy of Management American Marketing Association INFORMS (Management Science) Copy citation Copied ✓