A BRANCH AND BOUND ALGORITHM FOR THE TOTAL WEIGHTED TARDINESS PROBLEM

被引：188

作者：

POTTS, CN ^{[1
]}

VANWASSENHOVE, LN ^{[1
]}

机构：

[1] CATHOLIC UNIV LEUVEN,B-3000 LOUVAIN,BELGIUM

来源：

OPERATIONS RESEARCH | 1985年 / 33卷 / 02期

关键词：

COMPUTER PROGRAMMING - Algorithms - MACHINERY - Scheduling - MATHEMATICAL PROGRAMMING; DYNAMIC - SYSTEMS SCIENCE AND CYBERNETICS - Man Machine Systems;

D O I：

10.1287/opre.33.2.363

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper presents a new branch and bound algorithm for the single machine total weighted tardiness problem. It obtains lower bounds using a Lagrangian relaxation approach with subproblems that are total weighted completion time problems. The well-known subgradient optimization technique is replaced by a multiplier adjustment method that leads to an extremely fast bound calculation. The method incorporates various devices for checking dynamic programming dominance in the search tree. Extensive computational results for problems with up to 50 jobs show the superiority of the algorithm over existing methods.

引用

页码：363 / 377

页数：15

共 50 条

[21] A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
Liaw, CF
COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (07) : 679 - 693
[22] A tabu search algorithm for the single machine total weighted tardiness problem
Bilge, Umit
Kurtulan, Mujde
Kirac, Furkan
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (03) : 1423 - 1435
[23] A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families
Tangudu, S. K.
Kurz, M. E.
PRODUCTION PLANNING & CONTROL, 2006, 17 (07) : 728 - 741
[24] Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm
Khoudi, Asmaa
Berrichi, Ali
OPERATIONAL RESEARCH, 2020, 20 (03) : 1763 - 1789
[25] A branch-and-bound algorithm to minimize total tardiness in a two-machine flowshop problem with different release time
Bang, June-Young
Jeong, BongJoo
JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2019, 13 (04)
[26] Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm
Asmaa Khoudi
Ali Berrichi
Operational Research, 2020, 20 : 1763 - 1789
[27] A branch-and-bound algorithm for the single-machine weighted earliness-tardiness scheduling problem with job independent weights
Tanaka, S
Sasaki, T
Araki, M
2003 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2003, : 1571 - 1577
[28] Particle swarm optimization algorithm for single machine total weighted tardiness problem
Tasgetiren, MF
Sevkli, M
Liang, YC
Gencyilmaz, G
CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, : 1412 - 1419
[29] A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
Tozkapan, A
Kirca, Ö
Chung, CS
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (02) : 309 - 320
[30] A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
Cordone, Roberto
Hosteins, Pierre
Righini, Giovanni
INFORMS JOURNAL ON COMPUTING, 2018, 30 (01) : 168 - 180

← 1 2 3 4 5 →