Abstract
In a scheduling problem with controllable processing times the job processing time can be compressed through incurring an additional cost. We consider the problem of scheduling n jobs on a single machine with controllable processing times. Each job has a release date, when it becomes available for processing, and, after completing its processing, requires an additional delivery time. Feasible schedules are further restricted by job precedence constraints. We develop a polynomial time approximation scheme whose running time depends only linearly on the input size. This improves and generalize the previous (3/2 + ɛ)-approximation algorithm by Zdrzalka.
Supported by the “Metaheuristics Network”, grant HPRN-CT-1999-00106, and by Swiss National Science Foundation project 20-63733.00/1, “Resource Allocation and Scheduling in Flexible Manufacturing Systems”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Graham, E. Lawler, J. Lenstra, and A. R. Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. In Annals of Discrete Mathematics, volume 5, pages 287–326. North-Holland, 1979.
L. Hall and D. Shmoys. Approximation algorithms for constrained scheduling problems. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pages 134–139, 1989.
L. Hall and D. Shmoys. Near-optimal sequencing with precedence constraints. In Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, pages 249–260. University of Waterloo Press, 1990.
L. Hall and D. Shmoys. Jackson’s rule for single-machine scheduling: Making a good heuristic better. MOR: Mathematics of Operations Research, 17:22–35, 1992.
B. Lageweg, J. Lenstra, and A. R. Kan. Minimizing maximum lateness on one machine: Computational experience and some applications. Statist. Neerlandica, 30:25–41, 1976.
E. Lawler. Fast approximation algorithms for knapsack problems. Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pages 206–218, 1977.
J. Lenstra, A. R. Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Operations Research, 1:343–362, 1977.
M. Mastrolilli. Grouping techniques for one machine scheduling subject to precedence constraints. In Proceedings of the 21st Foundations of Software Technology and Theoretical Computer Science, volume LNCS 2245, pages 268–279, 2001.
S. Zdrzalka. Scheduling jobs on a single machine with release dates, delivery times, and controllable processing times: worst-case analysis. Operations Research Letters, 10:519–532, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mastrolilli, M. (2002). A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times. In: Penttonen, M., Schmidt, E.M. (eds) Algorithm Theory — SWAT 2002. SWAT 2002. Lecture Notes in Computer Science, vol 2368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45471-3_6
Download citation
DOI: https://doi.org/10.1007/3-540-45471-3_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43866-3
Online ISBN: 978-3-540-45471-7
eBook Packages: Springer Book Archive