Integer Programming and Combinatorial Optimization
Volume 1412 of the series Lecture Notes in Computer Science pp 367382
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
 Alix MunierAffiliated withLaboratoire LIP6, Université Pierre et Marie Curie
 , Maurice QueyranneAffiliated withKarlsruhe UniversityFaculty of Commerce and Business Administration, University of British ColumbiaUniversità di Bologna — Sede di Rimini
 , Andreas S. SchulzAffiliated withFachbereich Mathematik, MA 61, Technische Universität Berlin
Abstract
A well studied and difficult class of scheduling problems con cerns parallel machines and precedence constraints. In order to model more realistic situations, we consider precedence delays, associating with each precedence constraint a certain amount of time which must elapse between the completion and start times of the corresponding jobs. Re lease dates, among others, may be modeled in this fashion. We provide the first constantfactor approximation algorithms for the makespan and the total weighted completion time objectives in this general class of problems. These algorithms are rather simple and practical forms of list scheduling. Our analysis also unifies and simplifies that of a number of special cases heretofore separately studied, while actually improving some of the former approximation results.
 Title
 Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
 Book Title
 Integer Programming and Combinatorial Optimization
 Book Subtitle
 6th International IPCO Conference Houston, Texas, June 22–24, 1998 Proceedings
 Pages
 pp 367382
 Copyright
 1998
 DOI
 10.1007/3540693467_28
 Print ISBN
 9783540645900
 Online ISBN
 9783540693468
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 1412
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 Robert E. Bixby ^{(4)}
 E. Andrew Boyd ^{(5)}
 Roger Z. RíosMercado ^{(6)}
 Editor Affiliations

 4. Department of Computational and Applied Mathematics, Rice University
 5. PROS Strategic Solutions
 6. Department of Industrial, Engineering, Texas A&M University
 Authors

 Alix Munier ^{(7)}
 Maurice Queyranne ^{(10)} ^{(8)}
 Andreas S. Schulz ^{(9)}
 Author Affiliations

 7. Laboratoire LIP6, Université Pierre et Marie Curie, 4 place Jussieu, 75 252, Paris, cedex 05, France
 10. Università di Bologna — Sede di Rimini, via Angherà 22, 47037, Rimini, Italy
 8. Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, B.C., Canada, V6T 1Z2
 9. Fachbereich Mathematik, MA 61, Technische Universität Berlin, Straße des 17. Juni 136, 10623, Berlin, Germany
Continue reading...
To view the rest of this content please follow the download PDF link above.