Years and Authors of Summarized Original Work
2004, 2009; Sanders, Sivadasan, Skutella
Problem Definition
In the classic online scheduling model, jobs arrive one after another. At the arrival of a new job, the scheduler must immediately and irrevocably assign it to a machine. In the parallel machine case, we have m identical machines to process the jobs. Each job j has a processing time p j that is revealed at the moment of its appearance. The load of a machine is the sum of processing times of jobs assigned to it. The objective is to minimize the makespan, that is, the maximum machine load.
The fact that decisions are irrevocable imposes a hard constraint on the scheduler. However, many applications allow some amount of flexibility. Robust scheduling algorithms take this flexibility into account: whenever a job arrives, some reassignment of jobs can be performed. More precisely, given a parameter β > 0, the arrival of job jallows to migrate a set of jobs with a total processing time...
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
Recommended Reading
Chen B, van Vliet A, Woeginger GJ (1994) A lower bound for randomized on-line scheduling algorithms. Inf Process Lett 51:219–222
Cook W, Gerards AMH, Schrijver A, Tardos É (1986) Sensitivity theorems in integer linear programming. Math Program 34:251–264
Epstein L, Levin A (2009) A robust APTAS for the classical bin packing problem. Math Program 119:33–49
Epstein L, Levin A (2013) Robust approximation schemes for cube packing. SIAM J Optim 23:1310–1343
Epstein L, Levin A (2014) Robust algorithms for preemptive scheduling. Algorithmica 69:26–57
Fleischer R, Wahl M (2000) On-line scheduling revisited. J Sched 3:343–353
Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Syst Tech J 45:1563–1581
Hochbaum DS, Shmoys DB (1987) Using dual approximation algorithms for scheduling problems: theoretical and practical results. J ACM 34:144–162
Jansen K, Klein KM (2013) A robust AFPTAS for online bin packing with polynomial migration. In: Fomin FV, Freivalds R, Kwiatkowska M, Peleg D (eds) Automata, languages, and programming (ICALP 2013). Lecture notes in computer science, vol 7965. Springer, Berlin/Heidelberg, Riga, Latvia pp 589–600
Sanders P, Sivadasan N, Skutella M (2009) Online scheduling with bounded migration. Math Oper Res 34:481–498
Sgall J (1997) A lower bound for randomized on-line multiprocessor scheduling. Inf Process Lett 63:51–55
Skutella M, Verschae J (2010) A robust PTAS for machine covering and packing. In: Berg M, Meyer U (eds) Algorithms – ESA 2010. Lecture notes in computer science, vol 6346. Springer, Berlin/Heidelberg, Liverpool, UK pp 36–47
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Verschae, J. (2016). Robust Scheduling Algorithms. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_499
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_499
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering