Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates

被引：3

作者：

Detienne, Boris ^{[1
]}

Pinson, Eric ^{[2
]}

Rivreau, David ^{[2
]}

机构：

[1] Ecole Natl Super Mines, Ctr Microelect Prov Georges Charpak, F-13541 Gardanne, France

[2] Inst Appl Math, F-49008 Angers, France

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2010年 / 201卷 / 01期

关键词：

Scheduling; Just-in-time; Elimination rules; Lagrangian relaxation; Exact method; SCHEDULING PROBLEM; BOUND ALGORITHM;

D O I：

10.1016/j.ejor.2009.02.005

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper presents new elimination rules for the single machine problem with general earliness and tardiness penalties subject to release dates. These rules, based on a Lagrangian decomposition, allow to drastically reduce the execution windows of the jobs. We measure the efficiency of these properties by integrating them in a branch-and-bound. Tests show that instances with up to 70 jobs without release dates, and up to 40 jobs with release dates, can be optimally solved within 1000 seconds. (C) 2009 Elsevier B. V. All rights reserved.

引用

页码：45 / 54

页数：10

共 50 条

[1] Single machine earliness-tardiness scheduling with resource-dependent release dates
Ventura, JA
Kim, D
Garriga, F
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 142 (01) : 52 - 69
[2] Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
Sourd, F
[J]. OPERATIONS RESEARCH LETTERS, 2006, 34 (05) : 591 - 598
[3] 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
[4] Minimizing the earliness-tardiness costs on a single machine
Bauman, J
Józefowska, J
[J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (11) : 3219 - 3230
[5] 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
[6] 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
[7] New solution approaches to the general single-machine earliness-tardiness problem
Yau, Hoksung
Pan, Yunpeng
Shi, Leyuan
[J]. IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2008, 5 (02) : 349 - 360
[8] Single machine weighted earliness-tardiness penalty problem with a common due date
Mondal, SA
Sen, AK
[J]. COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (07) : 649 - 669
[9] Minimizing Total Earliness and Total Tardiness on Single Machine with Release Dates
Oyetunji, E. O.
Oluleye, A. E.
[J]. INTERNATIONAL JOURNAL OF ENGINEERING RESEARCH IN AFRICA, 2011, 5 : 30 - 43
[10] Lower Bounds for Earliness-Tardiness Minimization on a single machine
Rebai, Maher
Kacem, Imed
Adjallah, Kondo H.
[J]. CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 23 - +

← 1 2 3 4 5 →