Abstract
We present hardness and approximation results for the problem of scheduling n independent jobs on m identical parallel machines subject to a migration delay d so as to minimize the makespan. We give a sharp threshold on the value of d for which the complexity of the problem changes from polynomial time solvable to NP-hard. We give initial results supporting a conjecture that there always exists an optimal schedule in which at most m – 1 jobs migrate. Further, we give a O(n) time O(1+1/log2 n)-approximation algorithm for m = 2, and show that there is a polynomial time approximation scheme for arbitrary m.
Most of the work has been done within two short-term visits at MPI für Informatik in Saarbrücken, supported in part by the EU project CRESCCO and the Russian Foundation for Basic Research (grant no. 05-01-00960).
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
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic scheduling: A survey. Annals of Discrete Mathematics, 287–326 (1979)
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Logistics of Production and Inventory. Handbooks in Operation Research and Management Science, vol. 4, pp. 445–522. North-Holland, Amsterdam (1993)
McNaughton, R.: Scheduling with deadlines and loss functions. Management Science 6 (1959)
Karp, R.M.: Recucibility among combinatorial problems. In: Complexity of Computer Computations. Plenum Press, New York (1972)
Rothkopf, M.H.: Scheduling independent tasks on parallel processors. Management Science 12, 347–447 (1966)
Hochbaum, D.S., Shmoys, D.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing 17, 539–551 (1988)
Hanen, C., Munier, A.: An approximation algorithm for scheduling dependent tasks on m processors with small communication delays. Discrete Applied Mathematics 108, 239–257 (2001)
Hoogeveen, J.A., Lenstra, J.K., Veltman, B.: Three, four, five, six, or the complexity of scheduling with communication delays. Operations Research Letters 16, 129–137 (1994)
Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: Ten open problems. Journal of Scheduling 2, 203–213 (1999)
Engels, D.W., Feldman, J., Karger, D.R., Ruhl, M.: Parallel processor scheduling with delay constraints. In: SODA, pp. 577–585 (2001)
Afrati, F.N., Bampis, E., Finta, L., Milis, I.: Scheduling trees with large communication delays on two identical processors. In: Bode, A., Ludwig, T., Karl, W.C., Wismüller, R. (eds.) Euro-Par 2000. LNCS, vol. 1900, pp. 288–295. Springer, Heidelberg (2000)
Engels, D.W.: Scheduling for hardware-software partitioning in embedded system design. PhD thesis, Massachusetts Institute of Technology, Cambridge, USA (2000)
Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)
Blum, M., Floyd, R., Pratt, V., Rivest, R., Tarjan, R.: Time bounds for selection. J. Comp. System Sci. (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fishkin, A.V., Jansen, K., Sevastyanov, S.V., Sitters, R. (2005). Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_52
Download citation
DOI: https://doi.org/10.1007/11561071_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29118-3
Online ISBN: 978-3-540-31951-1
eBook Packages: Computer ScienceComputer Science (R0)