Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
Chung-Yee Lee, T. C. E. Cheng, B. M. T. Lin
Management Science · 1993 · Volume 39 · Issue 5
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
Enable JavaScript for citation tools and additional paper interactions.