Abstract
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job processing times are known in advance and preemption of jobs is allowed. Machines are non-continuously available, i.e., they can break down and recover at arbitrary time instances not known in advance. New machines may be added as well. Thus machine availabilities change online.
We first show that no online algorithm can construct optimal schedules. We also show that no online algorithm can achieve a bounded competitive ratio if there may be time intervals where no machine is available. Then we present an online algorithm that constructs schedules with an optimal makespan of C\(^{OPT}_{\rm max}\) if a lookahead of one is given, i.e., the algorithm always knows the next point in time when the set of available machines changes. Finally we give an online algorithm without lookahead that constructs schedules with a nearly optimal makespan of C\(^{OPT}_{\rm max}\) + ε, for any ε >0, if at any time at least one machine is available. Our results demonstrate that not knowing machine availabilities in advance is of little harm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kalyanasundaram, B., Pruhs, K.P.: Fault-tolerant scheduling. In: Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, pp. 115–124 (1994)
Kalyanasundaram, B., Pruhs, K.P.: Fault-tolerant real-time scheduling. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol. 1284. Springer, Heidelberg (1997)
McNaughton, R.: Scheduling with deadlines and loss functions. Management Science 6, 1–12 (1959)
Sanlaville, E.: Nearly on line scheduling of preemptive independent tasks. Discrete Applied Mathematics 57, 229–241 (1995)
Sanlaville, E.: Private communication (1998)
Schmidt, G.: Scheduling on semi-identical processors. Z. Oper. Res. 28, 153–162 (1984)
Schmidt, G.: Scheduling independent tasks with deadlines on semi-identical processors. J. Oper. Res. Soc. 39, 271–277 (1988)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28, 202–208 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Albers, S., Schmidt, G. (1999). Scheduling with Unexpected Machine Breakdowns. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds) Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 1999 1999. Lecture Notes in Computer Science, vol 1671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48413-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-48413-4_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66329-4
Online ISBN: 978-3-540-48413-4
eBook Packages: Springer Book Archive