haku: @indexterm Scheduling / yhteensä: 635
viite: 286 / 635
| Tekijä: | Lee, C. Cheng, T. Lin, B. |
| Otsikko: | Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem |
| Lehti: | Management Science
1993 : MAY, VOL. 39:5, p. 616-625 |
| Asiasana: | SCHEDULING PRODUCTION MANAGEMENT SCIENCE |
| Kieli: | eng |
| Tiivistelmä: | This paper considers minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. After problem formulation, the authors present a proof to show that the general version of this problem is strongly NP-complete. The authors 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 analysed. |
SCIMA