Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14234
For citation please use:
Main Title: Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem
Author(s): Phillips, Cynthia A.
Schulz, Andreas S.
Shmoys, David B.
Stein, Cliff
Wein, Joel
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15461
http://dx.doi.org/10.14279/depositonce-14234
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: 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.
Subject(s): scheduling
algorithm
list
post
Issue Date: 1996
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 1996, 536
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-536-1996.pdf
Format: Adobe PDF | Size: 12.03 MB
DownloadShow Preview
Thumbnail
Report-536-1996.ps
Format: Postscript | Size: 211.87 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.