Abstract
In this paper we study the SRDM problem motivated by a variety of practical applications. We are given n jobs with integer release times,deadlines, and processing times. The goal is to find a non-preemptive schedule such that all jobs meet their deadlines and the number of machines needed to process all jobs is minimum. If all jobs have equal release times and equal deadlines, SRDM is the classical bin packing problem, which is NP-complete. The slack of a job is the difference between its release time and the last possible time it may be started while still meeting its deadline. We show that instances consisting of jobs with slack at most one can be solved efficiently. We close the resulting gap by showing that the problem already becomes NP-complete if slacks up to 2 are allowed. Additionally, we consider several variants of the SRDM problem and provide exact and approximation algorithms.
Work partially supported by the EU Thematic Network APPOL II, IST-2001-32007, with funding provided by the Swiss Federal Office for Education and Science.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Bar-Noy, R. Bar-Yehuda, A. Freund, J.S. Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 48(5): 1069–1090, 2001.
A. Bar-Noy, S. Guha, J.S. Naor, and B. Schieber. Approximating the throughput of multiple machines in real-time scheduling. SIAM Journal on Computing, 31(2):331–352, 2001.
P. Berman and B. DasGupta. Multi-phase algorithms for throughput maximization for real-time scheduling. Journal of Combinatorial Optimization, 4(3):307–323, 2000.
A. Brandstädt, V.B. Le, and J.P. Spinrad. Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications, 1999.
J. Chuzhoy and S. Naor. New hardness results for congestion minimization and machine scheduling. accepted for STOC’04, 2004.
J. Chuzhoy, R. Ostrovsky, and Y. Rabani. Approximation algorithms for the job interval selection problem and related scheduling problems. In IEEE Symposium on Foundations of Computer Science, pages 348–356, 2001.
M. Cieliebak, T. Erlebach, F. Hennecke, B. Weber, and P. Widmayer. Scheduling jobs on a minimum number of machines. Technical Report 419, Institute of Theoretical Computer Science, ETH Zürich, 2003.
E.G. Coffman Jr., M.R. Garey, and D.S. Johnson. Approximation algorithms for bin packing: A survey. In D. Hochbaum, editor, Approximation Algorithms for NP-hard Problems. PWS, 1996.
T. Erlebach and F.C.R. Spieksma. Interval selection: Applications, algorithms, and lower bounds. Journal of Algorithms, 46(1):27–53, 2003.
M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman and Company, New York, 1979.
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys. Sequencing and scheduling: Algorithms and complexity. In S.C. Graves, A.H.G. Rinnooy Kan, and P. Zip kin, editors, Handbooks in Operations Research and Management Science, volume 4, pages 445–522. North-Holland, 1993.
F. Malucelli and S. Nicoloso. Shiftable interval graphs. In Proc. 6th International Conference on Graph Theory, 2000.
D.D. Sleator and R.E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362–391, 1983.
F.C.R. Spieksma. Approximating an interval scheduling problem. In International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, volume 1444, pages 169–180. Springer-Verlag LNCS, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science + Business Media, Inc.
About this paper
Cite this paper
Cieliebak, M., Erlebach, T., Hennecke, F., Weber, B., Widmayer, P. (2004). Scheduling With Release Times and Deadlines on A Minimum Number of Machines. In: Levy, JJ., Mayr, E.W., Mitchell, J.C. (eds) Exploring New Frontiers of Theoretical Informatics. IFIP International Federation for Information Processing, vol 155. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8141-3_18
Download citation
DOI: https://doi.org/10.1007/1-4020-8141-3_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-8140-8
Online ISBN: 978-1-4020-8141-5
eBook Packages: Springer Book Archive