We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Minimizing the Makespan in the 3-Machine Assembly-type Flowshop Scheduling Problem.
- Authors
Lee, Chung-Yee; Cheng, T. C. E.; Lin, B. M. T.
- 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.
- Subjects
PRODUCTION scheduling; ASSEMBLY line methods; ALGORITHMS; NP-complete problems; FACTORY management; MANUFACTURING processes; PRODUCTION (Economic theory); PRODUCTION management (Manufacturing); HEURISTIC; BRANCH &; bound algorithms; INDUSTRIAL efficiency; MATHEMATICAL optimization
- Publication
Management Science, 1993, Vol 39, Issue 5, p616
- ISSN
0025-1909
- Publication type
Article
- DOI
10.1287/mnsc.39.5.616