A bi-criteria two-machine flowshop scheduling problem with a learning effect |
| |
Authors: | P Chen C-C Wu W-C Lee |
| |
Affiliation: | 1.Feng Chia University,Taichung,Taiwan |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|