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 条

[1] Minimizing the earliness-tardiness costs on a single machine
Rebai, Maher
Kacem, Imed
[J]. 2008 5TH INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, 2008, : 636 - 640
[2] Minimizing the earliness-tardiness costs on a single machine
Bauman, J
Józefowska, J
[J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (11) : 3219 - 3230
[3] Earliness-tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods
Rebai, Maher
Kacem, Imed
Adjallah, Kondo H.
[J]. JOURNAL OF INTELLIGENT MANUFACTURING, 2012, 23 (04) : 1207 - 1224
[4] Single machine scheduling with earliness-tardiness and completion time penalties
Zhao, Yufang
[J]. 2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6, 2007, : 268 - 271
[5] Single operation earliness-tardiness scheduling with machine activation costs
Panwalkar, SS
Liman, SD
[J]. IIE TRANSACTIONS, 2002, 34 (05) : 509 - 513
[6] A new optimization approach to the general single machine earliness-tardiness problem
Pan, YP
Shi, LY
Yau, H
[J]. 2005 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2005, : 43 - 48
[7] Fast neighborhood search for the single machine earliness-tardiness scheduling problem
Kedad-Sidhoum, Safia
Sourd, Francis
[J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (08) : 1464 - 1471
[8] Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
Kedad-Sidhoum, Safia
Solis, Yasmin Rios
Sourd, Francis
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 189 (03) : 1305 - 1316
[9] Lower bounds for tardiness minimization on a single machine with family setup times
Kacem, Imed
[J]. 2006 IMACS: MULTICONFERENCE ON COMPUTATIONAL ENGINEERING IN SYSTEMS APPLICATIONS, VOLS 1 AND 2, 2006, : 1034 - 1039
[10] Stochastic Dynamic Programming for Earliness-Tardiness Single Machine Scheduling with Maintenance Considerations
Abderrazzak, Sabri
Hamid, Allaoui
Omar, Souissi
[J]. ADVANCES IN PRODUCTION MANAGEMENT SYSTEMS: ARTIFICIAL INTELLIGENCE FOR SUSTAINABLE AND RESILIENT PRODUCTION SYSTEMS, PT V, 2021, 634 : 269 - 276

← 1 2 3 4 5 →