Annals of Operations Research

, Volume 204, Issue 1, pp 189–222 | Cite as

Makespan minimization in online scheduling with machine eligibility

  • Kangbok Lee
  • Joseph Y.-T. Leung
  • Michael L. Pinedo
Article

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.

Keywords

Parallel 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 

References

  1. Albers, S. (2003). Online algorithms: a survey. Mathematical Programming Series B, 97, 3–26. Google Scholar
  2. Azar, Y., Naor, J., & Rom, R. (1995). The competitiveness of on-line assignments. Journal of Algorithms, 18, 221–237. CrossRefGoogle Scholar
  3. Bar-Noy, A., Freund, A., & Naor, J. (2001). Online load balancing in a hierarchical server topology. SIAM Journal on Computing, 31, 527–549. CrossRefGoogle Scholar
  4. Chassid, O., & Epstein, L. (2008). The hierarchical model for load balancing on two machines. Journal of Combinatorial Optimization, 15, 305–314. CrossRefGoogle Scholar
  5. Chen, B., & Vestjens, A. P. A. (1997). Scheduling on identical machines: how good is LPT in an on-line setting? Operations Research Letters, 21, 165–169. CrossRefGoogle Scholar
  6. Dosa, G., & Epstein, L. (2008). Preemptive scheduling on a small number of hierarchical machines. Information and Computation, 206(5), 602–619. CrossRefGoogle Scholar
  7. 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). Google Scholar
  8. Glass, C. A., & Mills, H. R. (2006). Scheduling unit length jobs with parallel nested machine processing set restrictions. Computers & Operations Research, 33, 620–638. CrossRefGoogle Scholar
  9. Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287–326. CrossRefGoogle Scholar
  10. Hall, L. A., Schulz, A. S., Shmoys, D. B., & Wein, J. (1997). Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Mathematics of Operations Research, 22(3), 513–544. CrossRefGoogle Scholar
  11. Hong, K. S., & Leung, J. Y.-T. (1992). On-line scheduling of real-time tasks. IEEE Transactions on Computers, 41, 1326–1331. CrossRefGoogle Scholar
  12. Hou, L., & Kang, L. (2011). Online and semi-online hierarchical scheduling for load balancing on uniform machines. Theoretical Computer Science, 412, 1092–1098. CrossRefGoogle Scholar
  13. Hou, L., & Kang, L. (2012). Online scheduling on uniform machines with two hierarchies. Journal of Combinatorial Optimization, 24(4), 593–612. CrossRefGoogle Scholar
  14. Hwang, H.-C., Chang, S. Y., & Hong, Y. (2004a). A posterior competitiveness for list scheduling algorithm on machines with eligibility constraints. Asia-Pacific Journal of Operational Research, 21, 117–125. CrossRefGoogle Scholar
  15. Hwang, H.-C., Chang, S. Y., & Lee, K. (2004b). Parallel machine scheduling under a grade of service provision. Computers & Operations Research, 31, 2055–2061. CrossRefGoogle Scholar
  16. Huo, Y., & Leung, J. Y.-T. (2010a). Parallel machine scheduling with nested processing set restrictions. European Journal of Operational Research, 204, 229–236. CrossRefGoogle Scholar
  17. Huo, Y., & Leung, J. Y.-T. (2010b). Fast approximation algorithms for job scheduling with processing set restrictions. Theoretical Computer Science, 411(44–46), 3947–3955. CrossRefGoogle Scholar
  18. Jiang, Y. (2008). Online scheduling on parallel machines with two GoS levels. Journal of Combinatorial Optimization, 16, 28–38. CrossRefGoogle Scholar
  19. Jiang, Y., He, Y., & Tang, C. (2006). Optimal online algorithms for scheduling on two identical machines under a grade of service. Journal of Zhejiang University. Science A, 7, 309–314. CrossRefGoogle Scholar
  20. Karhi, S., & Shabtay, D. (2012). On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines. Journal of Combinatorial Optimization. doi:10.1007/s10878-012-9460-4. Google Scholar
  21. Lawler, E. L., & Labetoulle, J. (1978). On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the ACM, 25(4), 612–619. CrossRefGoogle Scholar
  22. Lee, K., Leung, J. Y.-T., & Pinedo, M. (2009). Online scheduling on two uniform machines subject to eligibility constraints. Theoretical Computer Science, 410, 3975–3981. CrossRefGoogle Scholar
  23. Lee, K., Leung, J. Y.-T., & Pinedo, M. (2010). Makespan minimization in online scheduling with machine eligibility. 4OR, 8(4), 331–364. CrossRefGoogle Scholar
  24. Lee, K., Leung, J. Y.-T., & Pinedo, M. (2011). Scheduling jobs with equal processing times subject to machine eligibility constraints. Journal of Scheduling, 14(1), 27–38. CrossRefGoogle Scholar
  25. Lenstra, J. K., Shmoys, D. B., & Tardos, E. (1990). Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46, 259–271. CrossRefGoogle Scholar
  26. Leung, J. Y.-T., & Li, C.-L. (2008). Scheduling with processing set restrictions: a survey. International Journal of Production Economics, 116, 251–262. CrossRefGoogle Scholar
  27. Lim, K., Lee, K., & Chang, S. Y. (2011). Improved bounds for online scheduling with eligibility constraints. Theoretical Computer Science, 412(39), 5211–5224. (Working paper title: On optimality of a greedy approach to the online scheduling under eligibility constraints). CrossRefGoogle Scholar
  28. Liu, M., Xu, Y., Chu, C., & Zheng, F. (2009). Online scheduling on two uniform machines to minimize the makespan. Theoretical Computer Science, 410(21–23), 2099–2109. CrossRefGoogle Scholar
  29. Liu, M., Chu, C., Xu, Y., & Zheng, F. (2011). Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times. Journal of Combinatorial Optimization, 21(1), 138–149. CrossRefGoogle Scholar
  30. Mandelbaum, M., & Shabtay, D. (2011). Scheduling unit length jobs on parallel machines with lookahead information. Journal of Scheduling, 14(4), 335–350. CrossRefGoogle Scholar
  31. McNaughton, R. (1959). Scheduling with deadlines and loss functions. Management Science, 6, 1–12. CrossRefGoogle Scholar
  32. Muratore, G., Schwarz, U. M., & Woeginger, G. J. (2010). Parallel machine scheduling with nested job assignment restrictions. Operations Research Letters, 38(1), 47–50. CrossRefGoogle Scholar
  33. Noga, J., & Seiden, S. S. (2001). An optimal online algorithm for scheduling two machines with release times. Theoretical Computer Science, 268, 133–143. CrossRefGoogle Scholar
  34. Ou, J., Leung, J. Y.-T., & Li, C.-L. (2008). Scheduling parallel machines with inclusive processing set restriction. Naval Research Logistics, 55(4), 328–338. CrossRefGoogle Scholar
  35. Park, J., Chang, S. Y., & Lee, K. (2006). Online and semi-online scheduling of two machines under a grade of service provision. Operations Research Letters, 34, 692–696. CrossRefGoogle Scholar
  36. Pruhs, K., Sgall, J., & Torng, E. (2004). Online scheduling. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis. Boca Raton: CRC Press. Google Scholar
  37. Sgall, J. (1998). On-line scheduling. In Lecture notes in computer science (Vol. 1442, pp. 196–231). Google Scholar
  38. Shabtay, D., & Karhi, S. (2012a). Online scheduling of two job types on a set of multipurpose machines with unit processing times. Computers & Operations Research, 39, 405–412. CrossRefGoogle Scholar
  39. Shabtay, D., & Karhi, S. (2012b, submitted). Online scheduling of two job types on a set of multipurpose machines (Working Paper). Google Scholar
  40. Shchepin, E. V., & Vakhania, N. (2005). An optimal rounding gives a better approximation for scheduling unrelated machines. Operations Research Letters, 33, 127–133. CrossRefGoogle Scholar
  41. Shmoys, D. B., Wein, J., & Williamson, D. P. (1995). Scheduling parallel machines on-line. SIAM Journal on Computing, 24(6), 1313–1331. CrossRefGoogle Scholar
  42. Tan, Z., & Zhang, A. (2010). A note on hierarchical scheduling on two uniform machines. Journal of Combinatorial Optimization, 20(1), 85–95. CrossRefGoogle Scholar
  43. Tan, Z., & Zhang, A. (2011). Online hierarchical scheduling: an approach using mathematical programming. Theoretical Computer Science, 412(3), 246–256. CrossRefGoogle Scholar
  44. Wang, Z., & Xing, W. (2010). Worst-case analysis for on-line service polices. Journal of Combinatorial Optimization, 19, 107–122. CrossRefGoogle Scholar
  45. Wang, Z., Xing, W., & Chen, B. (2009). On-line service scheduling. Journal of Scheduling, 12(1), 31–43. CrossRefGoogle Scholar
  46. Wu, Y., Ji, M., & Yang, Q. (2012). Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision. International Journal of Production Economics, 135(1), 367–371. CrossRefGoogle Scholar
  47. Zhang, A., Jiang, Y., & Tan, Z. (2008). Optimal algorithms for online hierarchical scheduling on parallel machines (Technical Report). Zhejiang University. Google Scholar
  48. Zhang, A., Jiang, Y., & Tan, Z. (2009). Online parallel machines scheduling with two hierarchies. Theoretical Computer Science, 410, 3597–3605. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Kangbok Lee
    • 1
  • Joseph Y.-T. Leung
    • 2
  • Michael L. Pinedo
    • 3
  1. 1.Department of Supply Chain Management & Marketing SciencesRutgers Business SchoolNewarkUSA
  2. 2.Department of Computer ScienceNew Jersey Institute of TechnologyNewarkUSA
  3. 3.Department of Information, Operations & Management Sciences, Stern School of BusinessNew York UniversityNew YorkUSA

Personalised recommendations