期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 174, 期 1, 页码 1-10出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2004.12.023
关键词
scheduling; permutation flowshop; tardiness; branch and bound
The m-machine permutation flowshop problem with the total tardiness objective is a common scheduling problem, which is known to be NP-hard. Here, we develop a branch and bound algorithm to solve this problem. Our algorithm incorporates a machine-based lower bound and a dominance test for pruning nodes. We undertake a numerical study that evaluates our algorithm and compares it with the best alternative existing algorithm. Extensive computational experiments indicate that our algorithm performs better and can handle test problems with n <= 20. (c) 2005 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据