Journal article
DEVELOPMENT OF A NEW HEURISTIC FOR SCHEDULING FLOW-SHOPS WITH PARALLEL MACHINES BY PRIORITIZING BOTTLENECK STAGES
Abstract
The flow-shop scheduling problem has been extensively studied in literature. Many researchers have developed various flow-shop scheduling algorithms and heuristics for a variety of cases. The problem of scheduling flow-shops with three or more stages has been shown to be NP-Complete in strong sense. Complexity of the problem increases if one or more of the flow-shop stages have multiple identical (parallel) machines. Flow-shops with parallel …
Authors
Phadnis S; Brevick J; Irani S
Journal
Journal of Integrated Design and Process Science Transactions of the SDPS Official Journal of the Society for Design and Process Science, Vol. 7, No. 1, pp. 87–97
DOI
10.3233/2003-jid7_06
ISSN
1092-0617