search query: @author Lin, B. / total: 9
reference: 9 / 9
« previous | next »
| Author: | Lee, C. Cheng, T. Lin, B. |
| Title: | Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem |
| Journal: | Management Science
1993 : MAY, VOL. 39:5, p. 616-625 |
| Index terms: | SCHEDULING PRODUCTION MANAGEMENT SCIENCE |
| Language: | eng |
| Abstract: | 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. |
« previous | next »
SCIMA