Lower Bounds for Earliness-Tardiness Minimization on a single machine

被引：0
|
作者：
Rebai, Maher [1 ]
Kacem, Imed [2 ]
Adjallah, Kondo H. [3 ]
机构：
[1] Univ Technol Troyes, CNRS, ICD LOSI, FRE 2848, Troyes, France
[2] Univ Paul Verlaine Metz, LITA, Metz, France
[3] Ecole Natl Ingn Metz, LGIPM, Metz, France
来源：
CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3 | 2009年
关键词：
Scheduling problem; Branch and bound; lower bound; upper bound; SCHEDULING PROBLEM; PENALTIES;
D O I：
10.1109/ICCIE.2009.5223868
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we propose tow lower bounds for the problem of scheduling N independent jobs on a single machine to minimize the sum of early and tardy costs. Jobs have distinct due dates and processing times with earliness and tardiness costs. The problem is proved to be NP-hard [2]. A simple local search algorithm is presented in order to derive an upper bound. for the problem and tested the proposed lower bounds in a branch and bound algorithm. Computational experiments show that in several cases, where the lower bounds of the literature are weak, our lower bounds are more efficient.
引用
收藏
页码：23 / +
页数：2
相关论文
共 50 条
12345