A branch-and-bound algorithm for the single-machine weighted earliness-tardiness scheduling problem with job independent weights

被引：0

作者：

Tanaka, S ^{[1
]}

Sasaki, T ^{[1
]}

Araki, M ^{[1
]}

机构：

[1] Kyoto Univ, Dept Elect Engn, Sakyo Ku, Kyoto 6068501, Japan

来源：

2003 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-5, CONFERENCE PROCEEDINGS | 2003年

关键词：

scheduling; earliness-tardiness minimization; branch-and-bound algorithm; multiplier adjustment method;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper we propose a branch-and-bound algorithm for the single-machine earliness-tardiness scheduling problem where weights for earliness and tardiness are independent of jobs. Here, machine idle times are allowed. In our branch-and-bound algorithm, the search tree is generated by fixing the processing order of jobs from the first to the last, or, from the last to the first. To improve the efficiency of the algorithm,. we propose new lower bounds. We also show dominance properties that are utilized both for reducing branches in the search tree and for improving the lower bounds. Then, we show the effectiveness of our algorithm by numerical experiments.

引用

页码：1571 / 1577

页数：7

共 50 条

[1] 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
[2] 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
[3] 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
[4] A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem
Wodecki, Mieczyslaw
[J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 37 (9-10): : 996 - 1004
[5] A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem
Mieczysław Wodecki
[J]. The International Journal of Advanced Manufacturing Technology, 2008, 37 : 996 - 1004
[6] 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
[7] 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
[8] 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
[9] A Branch and Bound Algorithm for the Weighted Earliness-Tardiness Project Scheduling Problem with Generalized Precedence Relations
Nadjafi, B. Afshar
Shadrokh, S.
[J]. SCIENTIA IRANICA TRANSACTION E-INDUSTRIAL ENGINEERING, 2009, 16 (01): : 55 - 64
[10] A Branch and Bound algorithm for the Weighted Earliness-Tardiness Project Scheduling Problem with Generalized Precedence Relations
Afshar Nadjafi, B.
Shadrokh, S.
[J]. Scientia Iranica, 2009, 16 (1 E) : 55 - 64

← 1 2 3 4 5 →