期刊
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
卷 79, 期 3, 页码 185-196出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0925-5273(02)00234-7
关键词
scheduling theory; permutation flowshop; flow time; machine-based lower bounds; branch and bound
The m-machine permutation flowshop problem with the total flow-time objective is a common scheduling problem, which is known to be NP-hard for m greater than or equal to 2. In this article, we develop a branch and bound algorithm to solve both the weighted and unweighted version of this problem. Our algorithm incorporates a new machine-based lower bound and a dominance test for pruning nodes. Computational experiments suggest that the algorithm can handle test problems with n less than or equal to 15. It also seems capable of dealing with larger problems for the unweighted objective, especially when the processing times are correlated. (C) 2002 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据