Makespan minimization in online scheduling with machine eligibility
- 270 Downloads
In this paper we provide a survey of online scheduling in parallel machine environments with machine eligibility constraints and the makespan as objective function. We first give a brief overview of the different parallel machine environments and then survey the various types of machine eligibility constraints, including tree-hierarchical processing sets, Grade of Service processing sets, interval processing sets, and nested processing sets. We furthermore describe the relationships between the various different types of processing sets. We proceed with describing two basic online scheduling paradigms, namely online over list and online over time. For each one of the two paradigms we survey all the results that have been recorded in the literature with regard to each type of machine eligibility constraints. We obtain also several extensions in various directions. In the concluding section we describe the most important open problems in this particular area.
KeywordsParallel machine scheduling Eligibility constraint Tree-hierarchical and GoS processing sets Interval and nested processing sets Online and Semi-online scheduling Offline scheduling Makespan Competitive ratio
MSC classification (2000)90B35: Scheduling theory, deterministic
Unable to display preview. Download preview PDF.
- Albers S (2003) Online algorithms: a survey. Math Program Ser B 97: 3–26Google Scholar
- Garg N, Kumar A (2007) Minimizing average flow-time: upper and lower bounds. In: Proceedings of the 48th annual IEEE symposium on foundations of computer science, pp 603–613Google Scholar
- Huo Y, Leung JY-T (2010b) Fast approximation algorithms for job scheduling with processing set restrictions, Theoretical Computer Science, to appear. doi:10.1016/j.tcs.2010.08.008
- Lee K, Leung JY-T, Pinedo M (2010) Scheduling jobs with equal processing times subject to machine eligibility constraints. J Sched, to appear. doi:10.1007/s10951-010-0190-0
- Leung JY-T, Li C-L (2008) Scheduling with processing set restrictions: a survey. Int J Prod Econ 116: 251–262Google Scholar
- Lim K, Lee K, Chang SY (2010) On optimality of a greedy approach to the online scheduling under eligibility constraints, Working paper, Department of Industrial and Management Engineering, Pohang University of Science and Technology, Republic of Korea 790–784Google Scholar
- Liu M, Chu C, Xu Y, Zheng F (2010) Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times. J Comb Optim, to appear. doi:10.1007/s10878-009-9231-z
- Mandelbaum M, Shabtay D (2010) Scheduling unit length jobs on parallel machines with lookahead information. J Sched, to appear. doi:10.1007/s10951-010-0192-y
- Pruhs K, Sgall J, Torng E (2004) Online scheduling. In: Leung JY-T (ed) Handbook of scheduling: algorithms, models, and performance analysis. CRC Press, Boca RatonGoogle Scholar