Scheduling alternative operations in two-machine flow-shops |
| |
Authors: | C-H Pan J-S Chen |
| |
Institution: | 1.National Taiwan Institute of Technology,Taiwan |
| |
Abstract: | Most of the previous studies on scheduling problems assume that each machine is used exclusively for one operation although it has, in practice, potential to carry out some others. This paper studies two-machine flow-shop scheduling problems in which either or both machines are versatile so that alternative operations are possible. Branch-and-bound algorithms are developed to minimize the makespan of jobs for these problems and computational experiments are conducted to illustrate the effectiveness of these algorithms. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|