TWO‐ AND THREE‐STAGE FLOWSHOP SCHEDULING WITH NO‐WAIT IN PROCESS
- Additional Document Info
- View All
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.
author list (cited authors)
CHENG, T., SRISKANDARAJAH, C., & WANG, G.
complete list of authors
CHENG, TC EDWIN||SRISKANDARAJAH, CHELLIAH||WANG, GUOQING