期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 176, 期 3, 页码 1508-1527出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2005.11.001
关键词
parallel machines scheduling; setup times; column generation; branch-and-price
We consider the problem of scheduling n independent jobs on m unrelated parallel machines with sequence-dependent setup times and availability dates for the machines and release dates for the jobs to minimize a regular additive cost function, In this work, we develop a new branch-and-price optimization algorithm for the solution of this general class of parallel machines scheduling problems. A new column generation accelerating method, termed primal box, and a specific branching variable selection rule that significantly reduces the number of explored nodes are proposed. The computational results show that the approach solves problems of large size to optimality within reasonable computational time. (c) 2005 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据