Makespan minimization in online scheduling with machine eligibility
 Kangbok Lee,
 Joseph Y.T. Leung,
 Michael L. Pinedo
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
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 treehierarchical 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.
 Albers, S (2003) Online algorithms: a survey. Math Program Ser B 97: pp. 326
 Azar, Y, Naor, J, Rom, R (1995) The competitiveness of online assignments. J Algorithm 18: pp. 221237 CrossRef
 BarNoy, A, Freund, A, Naor, J (2001) Online load balancing in a hierarchical server topology. SIAM J Comput 31: pp. 527549 CrossRef
 Chen, B, Vestjens, APA (1997) Scheduling on identical machines: how good is LPT in an online setting?. Oper Res Lett 21: pp. 165169 CrossRef
 Dosa, G, Epstein, L (2008) Preemptive scheduling on a small number of hierarchical machines. Inf Comput 206: pp. 602619 CrossRef
 Garg N, Kumar A (2007) Minimizing average flowtime: upper and lower bounds. In: Proceedings of the 48th annual IEEE symposium on foundations of computer science, pp 603–613
 Glass, CA, Mills, HR (2006) Scheduling unit length jobs with parallel nested machine processing set restrictions. Comput Oper Res 33: pp. 620638 CrossRef
 Graham, RL, Lawler, EL, Lenstra, JK, Rinnooy Kan, AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5: pp. 287326 CrossRef
 Hall, LA, Schulz, AS, Shmoys, DB, Wein, J (1997) Scheduling to minimize average completion time: offline and online approximation algorithms. Math Oper Res 22: pp. 513544 CrossRef
 Hong, KS, Leung, JYT (1992) Online scheduling of realtime tasks. IEEE Trans Comput 41: pp. 13261331 CrossRef
 Huo, Y, Leung, JYT (2010) Parallel machine scheduling with nested processing set restrictions. Eur J Oper Res 204: pp. 229236 CrossRef
 Huo Y, Leung JYT (2010b) Fast approximation algorithms for job scheduling with processing set restrictions, Theoretical Computer Science, to appear. doi:10.1016/j.tcs.2010.08.008
 Hwang, HC, Chang, SY, Hong, Y (2004) A posterior competitiveness for list scheduling algorithm on machines with eligibility constraints. AsiaPac J Oper Res 21: pp. 117125 CrossRef
 Hwang, HC, Chang, SY, Lee, K (2004) Parallel machine scheduling under a grade of service provision. Comput Oper Res 31: pp. 20552061 CrossRef
 Jiang, Y (2008) Online scheduling on parallel machines with two GoS levels. J Comb Optim 16: pp. 2838 CrossRef
 Jiang, Y, He, Y, Tang, C (2006) Optimal online algorithms for scheduling on two identical machines under a grade of service. J Zhejiang Univ Sci A 7: pp. 309314 CrossRef
 Lawler, EL, Labetoulle, J (1978) On preemptive scheduling of unrelated parallel processors by linear programming. J ACM 25: pp. 612619 CrossRef
 Lee, K, Leung, JYT, Pinedo, M (2009) Online scheduling on two uniform machines subject to eligibility constraints. Theor Comput Sci 410: pp. 39753981 CrossRef
 Lee K, Leung JYT, Pinedo M (2010) Scheduling jobs with equal processing times subject to machine eligibility constraints. J Sched, to appear. doi:10.1007/s1095101001900
 Lenstra, JK, Shmoys, DB, Tardos, E (1990) Approximation algorithms for scheduling unrelated parallel machines. Math Program 46: pp. 259271 CrossRef
 Leung, JYT, Li, CL (2008) Scheduling with processing set restrictions: a survey. Int J Prod Econ 116: pp. 251262
 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–784
 Liu, M, Xu, Y, Chu, C, Zheng, F (2009) Online scheduling on two uniform machines to minimize the makespan. Theor Comput Sci 410: pp. 20992109 CrossRef
 Liu M, Chu C, Xu Y, Zheng F (2010) Semionline scheduling on 2 machines under a grade of service provision with bounded processing times. J Comb Optim, to appear. doi:10.1007/s108780099231z
 Mandelbaum M, Shabtay D (2010) Scheduling unit length jobs on parallel machines with lookahead information. J Sched, to appear. doi:10.1007/s109510100192y
 McNaughton, R (1959) Scheduling with deadlines and loss functions. Manag Sci 6: pp. 112 CrossRef
 Muratore, G, Schwarz, UM, Woeginger, GJ (2010) Parallel machine scheduling with nested job assignment restrictions. Oper Res Lett 38: pp. 4750 CrossRef
 Noga, J, Seiden, SS (2001) An optimal online algorithm for scheduling two machines with release times. Theor Comput Sci 268: pp. 133143 CrossRef
 Ou, J, Leung, JYT, Li, CL (2008) Scheduling parallel machines with inclusive processing set restriction. Nav Res Logist 55: pp. 328338 CrossRef
 Park, J, Chang, SY, Lee, K (2006) Online and semionline scheduling of two machines under a grade of service provision. Oper Res Lett 34: pp. 692696 CrossRef
 Pruhs, K, Sgall, J, Torng, E Online scheduling. In: Leung, JYT eds. (2004) Handbook of scheduling: algorithms, models, and performance analysis. CRC Press, Boca Raton
 Sgall, J (1998) Online scheduling. Lecture Notes in Computer Science 1442: pp. 196231 CrossRef
 Shchepin, EV, Vakhania, N (2005) An optimal rounding gives a better approximation for scheduling unrelated machines. Oper Res Lett 33: pp. 127133 CrossRef
 Shmoys, DB, Wein, J, Williamson, DP (1995) Scheduling parallel machines online. SIAM J Comput 24: pp. 13131331 CrossRef
 Tan, Z, Zhang, A (2010) A note on hierarchical scheduling on two uniform machines. J Comb Optim 20: pp. 8595 CrossRef
 Tan, Z, Zhang, A (2010) Online hierarchical scheduling: an approach using mathematical programming. Theorl Comput Sci..
 Wang, Z, Xing, W (2010) Worstcase analysis for online service polices. J Comb Optim 19: pp. 107122 CrossRef
 Wang, Z, Xing, W, Chen, B (2009) Online service scheduling. J Sched 12: pp. 3143 CrossRef
 Wu, Y, Yang, Q (2010) Optimal semionline scheduling algorithms on two parallel identical mamchhines under a Grade of Service provision. Lecture Notes in Computer Science 6124: pp. 261270 CrossRef
 Zhang, A, Jiang, Y, Tan, Z (2009) Online parallel machines scheduling with two hierarchies. Theor Comput Sci 410: pp. 35973605 CrossRef
 Title
 Makespan minimization in online scheduling with machine eligibility
 Journal

4OR
Volume 8, Issue 4 , pp 331364
 Cover Date
 20101201
 DOI
 10.1007/s1028801001491
 Print ISSN
 16194500
 Online ISSN
 16142411
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 Parallel machine scheduling
 Eligibility constraint
 Treehierarchical and GoS processing sets
 Interval and nested processing sets
 Online and Semionline scheduling
 Offline scheduling
 Makespan
 Competitive ratio
 90B35: Scheduling theory, deterministic
 Industry Sectors
 Authors

 Kangbok Lee ^{(1)}
 Joseph Y.T. Leung ^{(2)}
 Michael L. Pinedo ^{(3)}
 Author Affiliations

 1. Department of Supply Chain Management and Marketing Sciences, Rutgers Business School, 1 Washington Park, Newark, NJ, 071023122, USA
 2. Department of Computer Science, New Jersey Institute of Technology, Newark, NJ, 07102, USA
 3. Department of Information, Operations and Management Sciences, Stern School of Business, New York University, 44 West 4th Street, New York, NY, 100121126, USA