Article ID: | iaor20072282 |
Country: | United Kingdom |
Volume: | 57 |
Issue: | 9 |
Start Page Number: | 1113 |
End Page Number: | 1125 |
Publication Date: | Sep 2006 |
Journal: | Journal of the Operational Research Society |
Authors: | Lee Wen-Chiung, Wu Chin-Chia, Chen P. |
Keywords: | programming: branch and bound |
This paper addresses a bi-criteria two-machine flowshop scheduling problem when the learning effect is present. The objective is to find a sequence that minimizes a weighted sum of the total completion time and the maximum tardiness. In this article, a branch-and-bound method, incorporating several dominance properties and a lower bound, is presented to search for the exact solution for small job-size problems. In addition, two heuristic algorithms are proposed to overcome the inefficiency of the branch-and-bound algorithm for large job-size problems. Finally, computational results for this problem are provided to evaluate the performance of the proposed algorithms.