A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties

被引：31

作者：

Keshavarz, Taha ^{[1
]}

Savelsbergh, Martin ^{[2
]}

Salmasi, Nasser ^{[3
]}

机构：

[1] Yazd Univ, Dept Ind Engn, Yazd, Iran

[2] Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA

[3] Sharif Univ Technol, Dept Ind Engn, Tehran, Iran

来源：

APPLIED MATHEMATICAL MODELLING | 2015年 / 39卷 / 20期

关键词：

Minimization of earliness and tardiness; Group scheduling; Sequence-dependent setup time; Time-indexed formulation; Lagrangian relaxation; Branch-and-bound algorithm; TIME-INDEXED FORMULATIONS; SETUP TIMES; MINIMIZE; DATES;

D O I：

10.1016/j.apm.2015.01.069

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

The NP-hard single machine sequence-dependent group scheduling problem with minimization of total weighted earliness and tardiness is investigated. An arc-time-indexed formulation is presented and a Lagrangian-based branch-and-bound algorithm is proposed. The Lagrangian relaxation of the arc-time-indexed formulation is solved as a shortest path problem. The results of an extensive computational study demonstrate the efficacy of the proposed algorithm and establish characteristics of some hard to solve instances. (C) 2015 Elsevier Inc. All rights reserved.

引用

页码：6410 / 6424

页数：15

共 50 条

[1] A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
Kianfar, K.
Moslehi, G.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (12) : 2978 - 2990
[2] A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
Liaw, CF
[J]. COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (07) : 679 - 693
[3] The single machine earliness and tardiness scheduling problem: Lower bounds and a branch-and-bound algorithm
Ronconi, Débora P.
Kawamura, Márcio S.
[J]. Computational and Applied Mathematics, 2010, 29 (02) : 107 - 124
[4] The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
Ronconi, Debora P.
Kawamura, Marcio S.
[J]. COMPUTATIONAL & APPLIED MATHEMATICS, 2010, 29 (02): : 107 - 124
[5] 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
[6] A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
Francis Sourd
Safia Kedad-Sidhoum
[J]. Journal of Scheduling, 2008, 11 : 49 - 58
[7] A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
Sourd, Francis
Kedad-Sidhoum, Safia
[J]. JOURNAL OF SCHEDULING, 2008, 11 (01) : 49 - 58
[8] Sequence-dependent batch chemical scheduling with earliness and tardiness penalties
McGraw, KE
Dessouky, MM
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (14) : 3085 - 3107
[9] A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
Luo, Xiaochuan
Chu, Chengbin
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 180 (01) : 68 - 81
[10] A branch-and-bound algorithm for the single-machine weighted earliness-tardiness scheduling problem with job independent weights
Tanaka, S
Sasaki, T
Araki, M
[J]. 2003 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2003, : 1571 - 1577

← 1 2 3 4 5 →