Scheduling jobs with equal processing times subject to machine eligibility constraints

We consider the problem of nonpreemptively scheduling a set of n jobs with equal processing times on m parallel machines so as to minimize the makespan. Each job has a prespecified set of machines on which it can be processed, called its eligible set. We consider the most general case of machine eligibility constraints as well as special cases of nested and inclusive eligible sets. Both online and offline models are considered. For offline problems we develop optimal algorithms that run in polynomial time, while for online problems we focus on the development of optimal algorithms of a new and more elaborate structure as well as approximation algorithms with good competitive ratios.

[1]  Frank Werner,et al.  On a parallel machine scheduling problem with equal processing times , 2009, Discret. Appl. Math..

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

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

[4]  Barbara B. Simons,et al.  Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines , 1983, SIAM J. Comput..

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

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

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

[8]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

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

[10]  Grissele Centeno,et al.  Minimizing makespan on parallel machines with release time and machine eligibility restrictions , 2004 .

[11]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[12]  Chung-Lun Li,et al.  Scheduling unit-length jobs with machine eligibility restrictions , 2006, Eur. J. Oper. Res..

[13]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

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

[15]  Peter Brucker,et al.  Complexity of scheduling problems with multi-purpose machines , 1997, Ann. Oper. Res..

[16]  Peter Brucker,et al.  Scheduling jobs with equal processing times and time windows on identical parallel machines , 2008, J. Sched..

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

[18]  Wenhua Li,et al.  Parallel machine scheduling of machine-dependent jobs with unit-length , 2004, Eur. J. Oper. Res..

[19]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[20]  Celia A. Glass,et al.  Parallel machine scheduling with job assignment restrictions , 2007 .

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