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 条

[31] A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
Lee, GC
Kim, YD
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2004, 42 (22) : 4731 - 4743
[32] A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert
Tavakkoli-Moghaddam, R
Moslehi, G
Vasei, M
Azaron, A
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2006, 174 (01) : 388 - 408
[33] A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents
Yin, Yunqiang
Wu, Chin-Chia
Wu, Wen-Hsiang
Hsu, Chou-Jung
Wu, Wen-Hung
[J]. APPLIED SOFT COMPUTING, 2013, 13 (02) : 1042 - 1054
[34] Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
Hendel, Y
Sourd, F
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 173 (01) : 108 - 119
[35] Earliness-Tardiness Scheduling with Delivery Times and Deteriorating Jobs
Lu, Yuan-Yuan
Zhang, Shuang
Tao, Jia-Yi
[J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2024,
[36] Scheduling with batch setup times and earliness-tardiness penalties
Chen, ZL
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (03) : 518 - 537
[37] A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM
BRUCKER, P
JURISCH, B
SIEVERS, B
[J]. DISCRETE APPLIED MATHEMATICS, 1994, 49 (1-3) : 107 - 127
[38] SOME APPLICATIONS OF BRANCH-AND-BOUND ALGORITHM TO MACHINE SCHEDULING PROBLEM
BROWN, APG
LOMNICKI, ZA
[J]. OPERATIONAL RESEARCH QUARTERLY, 1966, 17 (02): : 173 - &
[39] A branch and bound approach for single machine scheduling with earliness and tardiness penalties
Chang, PC
[J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1999, 37 (10) : 133 - 144
[40] An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem
Vanhoucke, M
Demeulemeester, E
Herroelen, W
[J]. ANNALS OF OPERATIONS RESEARCH, 2001, 102 (1-4) : 179 - 196

← 1 2 3 4 5 →