Improved bounds on relaxations of a parallel machine scheduling problem

被引：15

作者：

Phillips, CA

Schulz, AS

Shmoys, DB

Stein, C

Wein, J

机构：

[1] Sandia Natl Labs, Albuquerque, NM 87185 USA

[2] Tech Univ Berlin, Dept Math, D-1000 Berlin, Germany

[3] Cornell Univ, Sch Operat Res & Ind Engn, Ithaca, NY 14853 USA

[4] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA

[5] Dartmouth Coll, Dept Comp Sci, Sudikoff Lab, Hanover, NH 03755 USA

[6] Polytech Univ, Dept Comp Sci, Brooklyn, NY 11201 USA

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 1998年 / 1卷 / 04期

基金：

美国国家科学基金会;

关键词：

scheduling; preemptive scheduling; release dates; identical parallel machines; average completion time; approximation algorithms; relaxations; linear programming;

D O I：

10.1023/A:1009750913529

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the average completion time of the optimal nonpreemptive schedule to that of the optimal preemptive schedule is at most 7/3, improving a bound of (3 - 1/m) due to Phillips, Stein and Wein. We then use our technique to give an improved bound on the quality of a linear programming relaxation of the problem considered by Hall, Schulz, Shmoys and Wein.

引用

页码：413 / 426

页数：14

共 50 条

[21] The Joint Load Balancing and Parallel Machine Scheduling Problem
Ouazene, Yassine
Hnaien, Faicel
Yalaoui, Farouk
Amodeo, Lionel
OPERATIONS RESEARCH PROCEEDINGS 2010, 2011, : 497 - 502
[22] Heuristic algorithms for a complex parallel machine scheduling problem
Zoltán Blázsik
Csanád Imreh
Zoltán Kovács
Central European Journal of Operations Research, 2008, 16 : 379 - 390
[23] Exponential neighborhood search for a parallel machine scheduling problem
Rios-Solis, Y. A.
Sourd, F.
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (05) : 1697 - 1712
[24] Online Algorithms for a Generalized Parallel Machine Scheduling Problem
Szalkai, Istvan
Dosa, Gyoergy
MACRO 2015: PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON RECENT ACHIEVEMENTS IN MECHATRONICS, AUTOMATION, COMPUTER SCIENCES AND ROBOTICS, 2015, : 193 - 200
[25] A note on the optimal makespan of a parallel machine scheduling problem
Li, Yumei
Gu, Yundong
Sun, Kaibiao
Li, Hongxing
FUZZY INFORMATION AND ENGINEERING, PROCEEDINGS, 2007, 40 : 481 - +
[26] Decomposition Methods for the Parallel Machine Scheduling Problem with Setups
Tran, Tony T.
Araujo, Arthur
Beck, J. Christopher
INFORMS JOURNAL ON COMPUTING, 2016, 28 (01) : 83 - 95
[27] A parallel machine batch scheduling problem in a brewing company
Boyer, Vincent (vincent.boyer@uanl.edu.mx), 1600, Springer London (87): : 1 - 4
[28] An exact algorithm for the identical parallel machine scheduling problem
Mokotoff, E
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 152 (03) : 758 - 769
[29] Parallel hybrid metaheuristic for the single machine scheduling problem
Minzu, V
Beldiman, L
PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL SYMPOSIUM ON ASSEMBLY AND TASK PLANNING (ISATP2003), 2003, : 134 - 139
[30] Cellular Automata approach for parallel machine scheduling problem
Kucharska, Edyta
Grobler-Debska, Katarzyna
Raczka, Krzysztof
Dutkiewicz, Lidia
SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL, 2016, 92 (02): : 165 - 178

← 1 2 3 4 5 →