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 条

[21] Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
Kramer, Arthur
Dell'Amico, Mauro
Iori, Manuel
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 275 (01) : 67 - 79
[22] AN IMPROVED 2.11-COMPETITIVE ALGORITHM FOR ONLINE SCHEDULING ON PARALLEL MACHINES TO MINIMIZE TOTAL WEIGHTED COMPLETION TIME
Ma, Ran
Tao, Jiping
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2018, 14 (02) : 497 - 510
[23] SCHEDULING WITH RELEASE DATES ON A SINGLE-MACHINE TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME
BELOUADAH, H
POSNER, ME
POTTS, CN
DISCRETE APPLIED MATHEMATICS, 1992, 36 (03) : 213 - 231
[24] Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints
Su, Ling-Huey
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 40 (5-6): : 572 - 581
[25] Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints
Ling-Huey Su
The International Journal of Advanced Manufacturing Technology, 2009, 40 : 572 - 581
[26] Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
Leung, JYT
Li, HB
Pinedo, M
NAVAL RESEARCH LOGISTICS, 2006, 53 (04) : 243 - 260
[27] Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
Mensendiek, Arne
Gupta, Jatinder N. D.
Herrmann, Jan
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 243 (02) : 514 - 522
[28] A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates
Rakrouki, Mohamed Ali
Kooli, Anis
Chalghoumi, Sabrine
Ladhari, Talel
OPERATIONAL RESEARCH, 2020, 20 (01) : 21 - 35
[29] A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates
Mohamed Ali Rakrouki
Anis Kooli
Sabrine Chalghoumi
Talel Ladhari
Operational Research, 2020, 20 : 21 - 35
[30] Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
Joseph Y.-T. Leung
Haibing Li
Michael Pinedo
Annals of Operations Research, 2008, 159 : 107 - 123

← 1 2 3 4 5 →