Scheduling Jobs with Equal Processing Times

Abstract Whereas the overwhelming majority of scheduling problems appears to be NP-hard, models with equal processing time jobs form a remarkable case which is still open for most problems but it intuitively looks polynomially solvable. The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time p. There are associated a release time rj and a deadline Dj with each job. All data are assumed to be integers. The aim is to construct a feasible schedule so as to minimize a given criterion. In this paper, we survey existing approaches for the problem considered, and for various machine environments.

[1]  Philippe Baptiste,et al.  Scheduling Equal Processing Time Jobs , 2004, Handbook of Scheduling.

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

[3]  Christoph Dürr,et al.  Finding Total Unimodularity in Optimization Problems Solved by Linear Programs , 2006, ESA.

[4]  Manfred K. Warmuth,et al.  A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs , 1989, SIAM J. Comput..

[5]  Michael Sipser,et al.  On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals , 1984, Oper. Res..

[6]  Philippe Baptiste,et al.  Scheduling equal-length jobs on identical parallel machines , 2000, Discret. Appl. Math..

[7]  David S. Johnson,et al.  Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness , 1977, Math. Oper. Res..

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

[9]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[10]  Svetlana A. Kravchenko.  Minimizing the Number of Machines in a Unit-Time Scheduling Problem , 2007 .

[11]  Robert E. Tarjan,et al.  Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines , 1981, SIAM J. Comput..

[12]  Philippe Baptiste,et al.  Ten notes on equal-processing-time scheduling , 2004, 4OR.

[13]  M. Fujii,et al.  Optimal Sequencing of Two Equivalent Processors , 1969 .

[14]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[15]  Barbara B. Simons,et al.  A fast algorithm for single processor scheduling , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[16]  B. J. Lageweg,et al.  Scheduling identical jobs on uniform parallel machines , 1989 .

[17]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[18]  Marek Chrobak,et al.  A Note on Scheduling Equal-Length Jobs to Maximize Throughput , 2006, J. Sched..

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