A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints |
| |
Authors: | B-J Joo Y-D Kim |
| |
Affiliation: | 1.Korea Advanced Institute of Science and Technology,Yuseong-gu,Korea |
| |
Abstract: | In this paper, we consider a two-machine flowshop scheduling problem in which the waiting time of each job between the two machines cannot be greater than a certain time period. For the problem with the objective of minimizing makespan, we identify several dominance properties of the problem and develop a branch-and-bound (B&B) algorithm using the dominance properties. Computational tests are performed on randomly generated test problems for evaluation of performance of the B&B algorithm, and results show that the algorithm can solve problems with up to 150 jobs in a reasonable amount of CPU time. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|