Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem

Chung-Yee Lee, T. C. E. Cheng and B. M. T. Lin
Additional contact information
Chung-Yee Lee: Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611
T. C. E. Cheng: Department of Management, Hong Kong Polytechnic, Hung Hom, Kowloon, Hong Kong
B. M. T. Lin: Department of Computer and Information Science, National Chaio-Tung University, Hsinchu, Taiwan 30050, R.O.C.

Management Science, 1993, vol. 39, issue 5, 616-625

Abstract: This paper considers minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. After problem formulation, we present a proof to show that the general version of this problem is strongly NP-complete. We then discuss a few polynomially solvable cases of the problem and present the solution algorithms. Next, a branch and bound solution scheme is suggested. Finally, three heuristics to find approximate solutions to the general problem are proposed and their error bounds are analyzed.

Keywords: flowshop; scheduling; assembly-type production (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (36)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.39.5.616 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:39:y:1993:i:5:p:616-625

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().