A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

被引：38

作者：

Sourd, Francis ^{[1
]}

Kedad-Sidhoum, Safia ^{[2
]}

机构：

[1] LIP6, CNRS, F-75252 Paris 05, France

[2] Univ Paris 06, LIP6, F-75252 Paris, France

来源：

JOURNAL OF SCHEDULING | 2008年 / 11卷 / 01期

关键词：

one-machine scheduling; earliness-tardiness; Lagrangean relaxation; branch-and-bound;

D O I：

10.1007/s10951-007-0048-2

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper addresses the one-machine scheduling problem with earliness-tardiness penalties. We propose a new branch-and-bound algorithm that can solve instances with up to 50 jobs and that can solve problems with even more general non-convex cost functions. The algorithm is based on the combination of a Lagrangean relaxation of resource constraints and new dominance rules.

引用

页码：49 / 58

页数：10

共 50 条

[21] A Faster Branch-and-Bound Algorithm for the Block Relocation Problem
Tanaka, Shunji
Takii, Kenta
[J]. IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2016, 13 (01) : 181 - 190
[22] An improved earliness-tardiness timing algorithm
Hendel, Yann
Sourd, Francis
[J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (10) : 2931 - 2938
[23] Scheduling with earliness-tardiness penalties and parallel machines
Rios-Solis, Yasmin A.
[J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2008, 6 (02): : 191 - 194
[24] 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
[25] A block approach to earliness-tardiness scheduling problems
Mieczysław Wodecki
[J]. The International Journal of Advanced Manufacturing Technology, 2009, 40 : 797 - 807
[26] A BRANCH-AND-BOUND ALGORITHM FOR ONE CLASS OF SCHEDULING PROBLEM
ANISIMOV, VG
ANISIMOV, YG
[J]. COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1992, 32 (12) : 1827 - 1832
[27] HEURISTIC ALGORITHMS FOR SOLVING EARLINESS-TARDINESS SCHEDULING PROBLEM WITH MACHINE VACATIONS
MANNUR, NR
ADDAGATLA, JB
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1993, 25 (1-4) : 255 - 258
[28] Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
Sourd, F
[J]. OPERATIONS RESEARCH LETTERS, 2006, 34 (05) : 591 - 598
[29] An enhanced branch-and-bound algorithm for the talent scheduling problem
Qin, Hu
Zhang, Zizhen
Lim, Andrew
Liang, Xiaocong
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 250 (02) : 412 - 426
[30] A block approach to earliness-tardiness scheduling problems
Wodecki, Mieczyslaw
[J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 40 (7-8): : 797 - 807

← 1 2 3 4 5 →