Lower bounds for scheduling on identical parallel machines with heads and tails

被引:10
|
作者
Haouari, M [1 ]
Gharbi, A [1 ]
机构
[1] Ecole Polytech Tunisie, Lab Math Engn, La Marsa, Tunisia
关键词
scheduling; identical parallel machines; release dates; delivery times; makespan; lower bound;
D O I
10.1023/B:ANOR.0000030688.31785.40
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we investigate new lower bounds for the P|r(j), q(j) | C-max scheduling problem. A new bin packing based lower bound, as well as several new lifting procedures are derived for this strongly NP-hard problem. Extensive numerical experiments show that the proposed lower bounds consistently outperform the best existing ones.
引用
收藏
页码:187 / 204
页数:18
相关论文
共 50 条