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 条

[31] Online bounded-batch scheduling to minimize total weighted completion time on parallel machines
Ma, Ran
Wan, Long
Wei, Lijun
Yuan, Jinjiang
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2014, 156 : 31 - 38
[32] Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
Leung, Joseph Y. -T.
Li, Haibing
Pinedo, Michael
ANNALS OF OPERATIONS RESEARCH, 2008, 159 (01) : 107 - 123
[33] A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
Tao, Jiping
COMPUTERS & OPERATIONS RESEARCH, 2014, 43 : 215 - 224
[34] SCHEDULING OF A SINGLE-MACHINE TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME SUBJECT TO RELEASE DATES
BIANCO, L
RICCIARDELLI, S
NAVAL RESEARCH LOGISTICS, 1982, 29 (01) : 151 - 167
[35] Online Scheduling with Rejection to Minimize the Total Weighted Completion Time Plus the Total Rejection Cost on Parallel Machines
Ma R.
Yuan J.-J.
Journal of the Operations Research Society of China, 2016, 4 (1) : 111 - 119
[36] Restricted job completion time variance minimisation on identical parallel machines
Chen, Yuerong
Li, Xueping
Sawhney, Rapinder
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2009, 3 (03) : 261 - 276
[37] A branch-and-bound algorithm for minimizing the total completion time in two-machine flowshop problem subject to release dates
Rakrouki, Mohamed Ali
Ladhari, Talel
CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 80 - +
[38] A branch and bound algorithm to minimize total weighted tardiness on a single processor
Babu, P
Peridy, L
Pinson, E
ANNALS OF OPERATIONS RESEARCH, 2004, 129 (1-4) : 33 - 46
[39] A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor
Pascal Babu
Laurent Peridy
Eric Pinson
Annals of Operations Research, 2004, 129 : 33 - 46
[40] A branch and bound algorithm to minimize completion time variance on a single processor
Viswanathkumar, G
Srinivasan, G
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (08) : 1135 - 1150

← 1 2 3 4 5 →