Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem

Cynthia A. Phillips (), Andreas S. Schulz (), David B. Shmoys (), Cliff Stein () and Joel Wein
Additional contact information
Cynthia A. Phillips: Sandia National Labs
Andreas S. Schulz: Technical University of Berlin
David B. Shmoys: Cornell University
Cliff Stein: Dartmouth College
Joel Wein: Polytechnic University

Journal of Combinatorial Optimization, 1998, vol. 1, issue 4, No 6, 413-426

Abstract: Abstract We consider the problem of scheduling n jobs withrelease 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 - \frac{1}{m})$$ Shmoys and Wein.

Keywords: scheduling; preemptive scheduling; release dates; identical parallel machines; average completion time; approximation algorithms; relaxations; linear programming (search for similar items in EconPapers)
Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009750913529 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:1:y:1998:i:4:d:10.1023_a:1009750913529

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009750913529

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().