期刊
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷 57, 期 9, 页码 1113-1125出版社
TAYLOR & FRANCIS LTD
DOI: 10.1057/palgrave.jors.2602095
关键词
scheduling; two-machine flowshop; learning effect; total completion time; maximum tardiness
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据