A branch and bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

被引：2

作者：

Nessah, Rabia ^{[1
]}

Yalaoui, Farouk ^{[1
]}

Chu, Chengbin ^{[1
]}

机构：

[1] Univ Technol Troyes, Inst Charles Delaunay, OSI, CNRS FRE 28248, F-10010 Troyes, France

来源：

2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS | 2006年

关键词：

identical parallel machine; scheduling; release dates; lower bound; dominance properties; branch and bound;

D O I：

10.1109/ICSSSM.2006.320678

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

In this paper, we consider an identical parallel machine scheduling problem with release dates. The objective is to minimize the total weighted completion time. This problem is know to be strongly NP-hard. We propose two lower bounds. We present an efficient heuristic, we also propose some dominance properties. A branch and bound algorithm in which the heuristic, the lower bounds and the dominance properties are incorporated is proposed and tested on a large set of randomly generated instances.

引用

页码：1192 / 1198

页数：7

共 50 条

[1] A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
Nessah, Rabia
Yalaoui, Farouk
Chu, Chengbin
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (04) : 1176 - 1190
[2] Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
Jaeger, Sven
OPERATIONS RESEARCH LETTERS, 2018, 46 (05) : 505 - 509
[3] Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
Kramer, Arthur
Dell'Amico, Mauro
Feillet, Dominique
Iori, Manuel
COMPUTERS & OPERATIONS RESEARCH, 2020, 123 (123)
[4] A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents
Lee, Wen-Chiung
Wang, Jen-Ya
Lin, Mei-Chun
KNOWLEDGE-BASED SYSTEMS, 2016, 105 : 68 - 82
[5] SCHEDULING IDENTICAL PARALLEL MACHINES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME
BELOUADAH, H
POTTS, CN
DISCRETE APPLIED MATHEMATICS, 1994, 48 (03) : 201 - 218
[6] Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
Nessah, Rabia
Chu, Chengbin
ANNALS OF OPERATIONS RESEARCH, 2010, 181 (01) : 359 - 375
[7] Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
Rabia Nessah
Chengbin Chu
Annals of Operations Research, 2010, 181 : 359 - 375
[8] BRANCH-AND-BOUND ALGORITHM FOR TOTAL WEIGHTED TARDINESS MINIMIZATION ON PARALLEL MACHINES UNDER RELEASE DATES ASSUMPTIONS
Kacem, Imed
Souayah, Nizar
Haouari, Mohamed
RAIRO-OPERATIONS RESEARCH, 2012, 46 (02) : 125 - 147
[9] A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines
Tanaka, Shunji
Araki, Mituhiko
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 113 (01) : 446 - 458
[10] A BRANCH-AND-BOUND ALGORITHM TO MINIMIZE TOTAL FLOW TIME WITH UNEQUAL RELEASE DATES
CHU, CB
NAVAL RESEARCH LOGISTICS, 1992, 39 (06) : 859 - 875

← 1 2 3 4 5 →