Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails

被引:2
|
作者
Mohamed Haouari
Anis Gharbi
机构
[1] Ecole Polytechnique de Tunisie,Laboratory of Mathematical Engineering
来源
关键词
scheduling; identical parallel machines; release dates; delivery times; makespan; lower bound;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, we investigate new lower bounds for the P|rj,qj|Cmax 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
页数:17
相关论文
共 50 条