Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475600 | Computers & Operations Research | 2014 | 9 Pages |
Abstract
We consider a two-machine re-entrant flowshop scheduling problem in which all jobs must be processed twice on each machine and there are sequence-dependent setup times on the second machine. For the problem with the objective of minimizing total tardiness, we develop dominance properties and a lower bound by extending those for a two-machine re-entrant flowshop problem (without sequence-dependent setup times) as well as heuristic algorithms, and present a branch and bound algorithm in which these dominance properties, lower bound, and heuristics are used. For evaluation of the performance of the branch and bound algorithm and heuristics, computational experiments are performed on randomly generated instances, and results are reported.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
BongJoo Jeong, Yeong-Dae Kim,