Automata, Languages and Programming
Volume 1099 of the series Lecture Notes in Computer Science pp 646657
Improved scheduling algorithms for minsum criteria
 Soumen ChakrabartiAffiliated withComputer Science Division, U. C. Berkeley
 , Cynthia A. PhillipsAffiliated withSandia National Labs
 , Andreas S. SchulzAffiliated withDepartment of Mathematics, Technical University of Berlin
 , David B. ShmoysAffiliated withSchool of Operations Research and Industrial Engineering, Cornell University
 , Cliff SteinAffiliated withDepartment of Computer Science, Sudikoff Laboratory, Dartmouth College
 , Joel WeinAffiliated withDepartment of Computer Science, Polytechnic University
Abstract
We consider the problem of finding nearoptimal solutions for a variety of NPhard scheduling problems for which the objective is to minimize the total weighted completion time. Recent work has led to the development of several techniques that yield constant worstcase bounds in a number of settings. We continue this line of research by providing improved performance guarantees for several of the most basic scheduling models, and by giving the first constant performance guarantee for a number of more realistically constrained scheduling problems. For example, we give an improved performance guarantee for minimizing the total weighted completion time subject to release dates on a single machine, and subject to release dates and/or precedence constraints on identical parallel machines. We also give improved bounds on the power of preemption in scheduling jobs with release dates on parallel machines.
We give improved online algorithms for many more realistic scheduling models, including environments with parallelizable jobs, jobs contending for shared resources, tree precedenceconstrained jobs, as well as shop scheduling models. In several of these cases, we give the first constant performance guarantee achieved online. Finally, one of the consequences of our work is the surprising structural property that there are schedules that simultaneously approximate the optimal makespan and the optimal weighted completion time to within small constants. Not only do such schedules exist, but we can find approximations to them with an online algorithm.
 Title
 Improved scheduling algorithms for minsum criteria
 Book Title
 Automata, Languages and Programming
 Book Subtitle
 23rd International Colloquium, ICALP '96 Paderborn, Germany, July 8–12, 1996 Proceedings
 Pages
 pp 646657
 Copyright
 1996
 DOI
 10.1007/3540614400_166
 Print ISBN
 9783540614401
 Online ISBN
 9783540685807
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 1099
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 Editors
 Authors

 Soumen Chakrabarti ^{(1)}
 Cynthia A. Phillips ^{(2)}
 Andreas S. Schulz ^{(3)}
 David B. Shmoys ^{(4)}
 Cliff Stein ^{(5)}
 Joel Wein ^{(6)}
 Author Affiliations

 1. Computer Science Division, U. C. Berkeley, 94720, CA
 2. Sandia National Labs, Albuquerque, NM
 3. Department of Mathematics, Technical University of Berlin, 10623, Berlin, Germany
 4. School of Operations Research and Industrial Engineering, Cornell University, 14853, Ithaca, NY
 5. Department of Computer Science, Sudikoff Laboratory, Dartmouth College, Hanover, NH
 6. Department of Computer Science, Polytechnic University, 11201, Brooklyn, NY
Continue reading...
To view the rest of this content please follow the download PDF link above.