Abstract
We consider the off-line scheduling problem of minimizing the maximal starting time. The input to this problem is a sequence of n jobs and m identical machines. The goal is to assign the jobs to the machines so that the first time in which all jobs have already started their processing is minimized, under the restriction that the processing of the jobs on any given machine must respect their original order. Our main result is a polynomial time approximation scheme for this problem in the case where m is considered as part of the input. As the input to this problem is a sequence of jobs, rather than a set of jobs where the order is insignificant, we present techniques that are designed to handle ordering constraints. Those techniques are combined with common techniques of assignment problems in order to yield a polynomial time approximation scheme.
Research supported in part by the Israel Science Foundation (grant no. 250/01).
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
Alon, N., et al.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling 1(1), 55–66 (1998)
Epstein, L., van Stee, R.: Minimizing the maximum starting time on-line. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 449–460. Springer, Heidelberg (2002)
Graham, R.L.: Bounds for certain multiprocessor anomalies. Bell System Technical Journal 45, 1563–1581 (1966)
Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math 17, 416–429 (1969)
Hochbaum, D., Shmoys, D.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing 17(3), 539–551 (1988)
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the Association for Computing Machinery 34(1), 144–162 (1987)
Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. Journal of the Association for Computing Machinery 23, 317–327 (1976)
Jansen, K., Porkolab, L.: Improved approximation schemes for scheduling unrelated parallel machines. In: Andersson, S.I. (ed.) Summer University of Southern Stockholm 1993. LNCS, vol. 888, pp. 408–417. Springer, Heidelberg (1999)
Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity os scheduling under precedence constraints. Operations Research 26, 22–35 (1978)
Mehta, S.R., Chandrasekaran, R., Emmons, H.: Order-presrving allocation of jobs to two machines. Naval Research Logistics Quarterly 21, 846–847 (1975)
Naor, J., Bar-Noy, A., Freund, A.: On-line load balancing in a hierarchical server topology. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 77–88. Springer, Heidelberg (1999)
Sahni, S.: Algorithms for scheduling independent tasks. Journal of the Association for Computing Machinery 23, 116–127 (1976)
Schuurman, P., Woeginger, G.: Polynomial time approximation algorithms for machine scheduling: Ten open problems. Journal of Scheduling 2, 203–213 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Epstein, L., Tassa, T. (2003). Approximation Schemes for the Min-Max Starting Time Problem. In: Rovan, B., Vojtáš, P. (eds) Mathematical Foundations of Computer Science 2003. MFCS 2003. Lecture Notes in Computer Science, vol 2747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45138-9_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-45138-9_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40671-6
Online ISBN: 978-3-540-45138-9
eBook Packages: Springer Book Archive