Earliness-tardiness scheduling with setup considerations

被引:41
|
作者
Sourd, F [1 ]
机构
[1] Univ Paris 06, LIP6, F-75252 Paris 05, France
关键词
earliness-tardiness scheduling; setup times; MIP formulation; branch-and-bound; heuristics;
D O I
10.1016/j.cor.2003.12.002
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The one-machine scheduling problem with sequence-dependent setup times and costs and earliness-tardiness penalties is addressed. A time-indexed formulation of the problem is presented as well as different relaxations that give lower bounds of the problem. Then, a branch-and-bound procedure based on one of these lower bounds is presented. The efficiency of this algorithm also relies on new dominance rules and on a heuristic to derive good feasible schedules. Computational tests are finally presented. (C) 2003 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1849 / 1865
页数:17
相关论文
共 50 条