Makespan minimization in online scheduling with machine eligibility

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.

[1]  Kangbok Lee,et al.  Online and semi-online scheduling of two machines under a grade of service provision , 2006, Oper. Res. Lett..

[2]  Jirí Sgall,et al.  On-line Scheduling , 1996, Online Algorithms.

[3]  Zhiyi Tan,et al.  Online parallel machines scheduling with two hierarchies , 2009, Theor. Comput. Sci..

[4]  Yin-Feng Xu,et al.  Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times , 2011, J. Comb. Optim..

[5]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[6]  Gerhard J. Woeginger,et al.  Parallel machine scheduling with nested job assignment restrictions , 2010, Oper. Res. Lett..

[7]  He Yong,et al.  Optimal online algorithms for scheduling on two identical machines under a grade of service , 2006 .

[8]  Eugene L. Lawler,et al.  On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.

[9]  Bo Chen,et al.  Scheduling on identical machines: How good is LPT in an on-line setting? , 1997, Oper. Res. Lett..

[10]  Yin-Feng Xu,et al.  Online scheduling on two uniform machines to minimize the makespan , 2009, Theor. Comput. Sci..

[11]  Dvir Shabtay,et al.  Online scheduling of two job types on a set of multipurpose machines , 2014 .

[12]  Dvir Shabtay,et al.  Online scheduling of two job types on a set of multipurpose machines with unit processing times , 2012, Comput. Oper. Res..

[13]  Liying Kang,et al.  Online scheduling on uniform machines with two hierarchies , 2012, J. Comb. Optim..

[14]  Leah Epstein,et al.  Preemptive scheduling on a small number of hierarchical machines , 2008, Inf. Comput..

[15]  Yong Wu,et al.  Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision , 2012 .

[16]  Kangbok Lee,et al.  Improved bounds for online scheduling with eligibility constraints , 2011, Theor. Comput. Sci..

[17]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[18]  Celia A. Glass,et al.  Scheduling unit length jobs with parallel nested machine processing set restrictions , 2006, Comput. Oper. Res..

[19]  Joseph Y.-T. Leung,et al.  Makespan minimization in online scheduling with machine eligibility , 2010, 4OR.

[20]  Yiwei Jiang,et al.  Online scheduling on parallel machines with two GoS levels , 2006, J. Comb. Optim..

[21]  Joseph Y.-T. Leung,et al.  Scheduling jobs with equal processing times subject to machine eligibility constraints , 2010, J. Sched..

[22]  Kangbok Lee,et al.  Parallel machine scheduling under a grade of service provision , 2004, Comput. Oper. Res..

[23]  Amit Kumar,et al.  Minimizing Average Flow-time : Upper and Lower Bounds , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[24]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[25]  Leah Epstein,et al.  The hierarchical model for load balancing on two machines , 2008, J. Comb. Optim..

[26]  Nodari Vakhania,et al.  An optimal rounding gives a better approximation for scheduling unrelated machines , 2005, Oper. Res. Lett..

[27]  Dvir Shabtay,et al.  Scheduling unit length jobs on parallel machines with lookahead information , 2011, J. Sched..

[28]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[29]  Joseph Y.-T. Leung,et al.  On-Line Scheduling of Real-Time Tasks , 1992, IEEE Trans. Computers.

[30]  Bo Chen,et al.  On-line service scheduling , 2009, J. Sched..

[31]  John Noga,et al.  An optimal online algorithm for scheduling two machines with release times , 2001, Theor. Comput. Sci..

[32]  Yong Wu,et al.  Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision , 2010, AAIM.

[33]  David P. Williamson,et al.  Scheduling parallel machines on-line , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[34]  Yossi Azar,et al.  The competitiveness of on-line assignments , 1992, SODA '92.

[35]  Dvir Shabtay,et al.  On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines , 2013, J. Comb. Optim..

[36]  Susanne Albers,et al.  Online algorithms: a survey , 2003, Math. Program..

[37]  Zhenbo Wang,et al.  Worst-case analysis for on-line service policies , 2010, J. Comb. Optim..

[38]  Chung-Lun Li,et al.  Scheduling parallel machines with inclusive processing set restrictions , 2008 .

[39]  Zhiyi Tan,et al.  A note on hierarchical scheduling on two uniform machines , 2010, J. Comb. Optim..

[40]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[41]  Joseph Naor,et al.  On-Line Load Balancing in a Hierarchical Server Topology , 2002, SIAM J. Comput..

[42]  Joseph Y.-T. Leung,et al.  Online scheduling on two uniform machines subject to eligibility constraints , 2009, Theor. Comput. Sci..

[43]  Soo Y. Chang,et al.  A posterior Competitiveness for List Scheduling Algorithm on Machines with Eligibility Constraints , 2004, Asia Pac. J. Oper. Res..

[44]  Joseph Y.-T. Leung,et al.  Parallel machine scheduling with nested processing set restrictions , 2010, Eur. J. Oper. Res..

[45]  Zhiyi Tan,et al.  Online hierarchical scheduling: An approach using mathematical programming , 2011, Theor. Comput. Sci..

[46]  Liying Kang,et al.  Online and semi-online hierarchical scheduling for load balancing on uniform machines , 2011, Theor. Comput. Sci..

[47]  Chung-Lun Li,et al.  Scheduling with processing set restrictions: A survey , 2008 .

[48]  Joseph Y.-T. Leung,et al.  Fast approximation algorithms for job scheduling with processing set restrictions , 2010, Theor. Comput. Sci..