Skip to main content
SpringerLink
Log in

Makespan minimization in online scheduling with machine eligibility

  • Invited Survey
  • Published:
4OR Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Albers S (2003) Online algorithms: a survey. Math Program Ser B 97: 3–26

    Google Scholar 

  • Azar Y, Naor J, Rom R (1995) The competitiveness of on-line assignments. J Algorithm 18: 221–237

    Article  Google Scholar 

  • Bar-Noy A, Freund A, Naor J (2001) Online load balancing in a hierarchical server topology. SIAM J Comput 31: 527–549

    Article  Google Scholar 

  • Chen B, Vestjens APA (1997) Scheduling on identical machines: how good is LPT in an on-line setting?. Oper Res Lett 21: 165–169

    Article  Google Scholar 

  • Dosa G, Epstein L (2008) Preemptive scheduling on a small number of hierarchical machines. Inf Comput 206(5): 602–619

    Article  Google 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–613

  • Glass CA, Mills HR (2006) Scheduling unit length jobs with parallel nested machine processing set restrictions. Comput Oper Res 33: 620–638

    Article  Google Scholar 

  • Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5: 287–326

    Article  Google Scholar 

  • Hall LA, Schulz AS, Shmoys DB, Wein J (1997) Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Math Oper Res 22(3): 513–544

    Article  Google Scholar 

  • Hong KS, Leung JY-T (1992) On-line scheduling of real-time tasks. IEEE Trans Comput 41: 1326–1331

    Article  Google Scholar 

  • Huo Y, Leung JY-T (2010a) Parallel machine scheduling with nested processing set restrictions. Eur J Oper Res 204: 229–236

    Article  Google 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

  • Hwang H-C, Chang SY, Hong Y (2004) A posterior competitiveness for list scheduling algorithm on machines with eligibility constraints. Asia-Pac J Oper Res 21: 117–125

    Article  Google Scholar 

  • Hwang H-C, Chang SY, Lee K (2004) Parallel machine scheduling under a grade of service provision. Comput Oper Res 31: 2055–2061

    Article  Google Scholar 

  • Jiang Y (2008) Online scheduling on parallel machines with two GoS levels. J Comb Optim 16: 28–38

    Article  Google Scholar 

  • 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: 309–314

    Article  Google Scholar 

  • Lawler EL, Labetoulle J (1978) On preemptive scheduling of unrelated parallel processors by linear programming. J ACM 25(4): 612–619

    Article  Google Scholar 

  • Lee K, Leung JY-T, Pinedo M (2009) Online scheduling on two uniform machines subject to eligibility constraints. Theor Comput Sci 410: 3975–3981

    Article  Google Scholar 

  • 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

  • Lenstra JK, Shmoys DB, Tardos E (1990) Approximation algorithms for scheduling unrelated parallel machines. Math Program 46: 259–271

    Article  Google Scholar 

  • Leung JY-T, Li C-L (2008) Scheduling with processing set restrictions: a survey. Int J Prod Econ 116: 251–262

    Google 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–784

  • Liu M, Xu Y, Chu C, Zheng F (2009) Online scheduling on two uniform machines to minimize the makespan. Theor Comput Sci 410(21–23): 2099–2109

    Article  Google 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

  • McNaughton R (1959) Scheduling with deadlines and loss functions. Manag Sci 6: 1–12

    Article  Google Scholar 

  • Muratore G, Schwarz UM, Woeginger GJ (2010) Parallel machine scheduling with nested job assignment restrictions. Oper Res Lett 38(1): 47–50

    Article  Google Scholar 

  • Noga J, Seiden SS (2001) An optimal online algorithm for scheduling two machines with release times. Theor Comput Sci 268: 133–143

    Article  Google Scholar 

  • Ou J, Leung JY-T, Li C-L (2008) Scheduling parallel machines with inclusive processing set restriction. Nav Res Logist 55(4): 328–338

    Article  Google Scholar 

  • Park J, Chang SY, Lee K (2006) Online and semi-online scheduling of two machines under a grade of service provision. Oper Res Lett 34: 692–696

    Article  Google Scholar 

  • 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 Raton

    Google Scholar 

  • Sgall J (1998) On-line scheduling. Lecture Notes in Computer Science 1442: 196–231

    Article  Google Scholar 

  • Shchepin EV, Vakhania N (2005) An optimal rounding gives a better approximation for scheduling unrelated machines. Oper Res Lett 33: 127–133

    Article  Google Scholar 

  • Shmoys DB, Wein J, Williamson DP (1995) Scheduling parallel machines on-line. SIAM J Comput 24(6): 1313–1331

    Article  Google Scholar 

  • Tan Z, Zhang A (2010a) A note on hierarchical scheduling on two uniform machines. J Comb Optim 20(1): 85–95

    Article  Google Scholar 

  • Tan Z, Zhang A (2010b) Online hierarchical scheduling: an approach using mathematical programming. Theorl Comput Sci. doi:10.1016/j.tcs.2009.08.014

    Google Scholar 

  • Wang Z, Xing W (2010) Worst-case analysis for on-line service polices. J Comb Optim 19: 107–122

    Article  Google Scholar 

  • Wang Z, Xing W, Chen B (2009) On-line service scheduling. J Sched 12(1): 31–43

    Article  Google Scholar 

  • Wu Y, Yang Q (2010) Optimal semi-online scheduling algorithms on two parallel identical mamchhines under a Grade of Service provision. Lecture Notes in Computer Science 6124: 261–270

    Article  Google Scholar 

  • Zhang A, Jiang Y, Tan Z (2009) Online parallel machines scheduling with two hierarchies. Theor Comput Sci 410: 3597–3605

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Supply Chain Management and Marketing Sciences, Rutgers Business School, 1 Washington Park, Newark, NJ, 07102-3122, USA

    Kangbok Lee

  2. Department of Computer Science, New Jersey Institute of Technology, Newark, NJ, 07102, USA

    Joseph Y.-T. Leung

  3. Department of Information, Operations and Management Sciences, Stern School of Business, New York University, 44 West 4th Street, New York, NY, 10012-1126, USA

    Michael L. Pinedo

Authors
  1. Kangbok Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joseph Y.-T. Leung
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael L. Pinedo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael L. Pinedo.

Additional information

This work is supported in part by the NSF Grant CMMI-0969830. M. L. Pinedo is supported in part by the NSF Grant CMMI-0969755.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, K., Leung, J.YT. & Pinedo, M.L. Makespan minimization in online scheduling with machine eligibility. 4OR-Q J Oper Res 8, 331–364 (2010). https://doi.org/10.1007/s10288-010-0149-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-010-0149-1

Keywords

MSC classification (2000)

Search

Navigation