Ten notes on equal-processing-time scheduling

Abstract.Equal-processing-time scheduling problems whose complexity status has been unknown are shown to be solved in polynomial time by well-known and relatively new techniques. Single-machine, parallel-machine, parallel-batch, open-shop, flow-shop and job-shop environments are touched upon.

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

[2]  J. A. Hoogeveen,et al.  Scheduling a batching machine , 1998 .

[3]  Peter Brucker,et al.  How useful are preemptive schedules? , 2003, Oper. Res. Lett..

[4]  Rafail Ostrovsky,et al.  Approximation algorithms for the job interval selection problem and related scheduling problems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[5]  W. Kubiak,et al.  A Note On The Complexity Of Openshop Scheduling Problems , 1991 .

[6]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[7]  E. L. Lawler,et al.  Preemptive scheduling of uniform parallel machines to minimize the weighted number of late jobs : (preprint) , 1979 .

[8]  Jan Karel Lenstra,et al.  Complexity results for scheduling chains on a single machine : (preprint) , 1980 .

[9]  E. L. Lawler,et al.  Recent Results in the Theory of Machine Scheduling , 1982, ISMP.

[10]  Martin Middendorf,et al.  Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems , 1999, J. Comb. Optim..

[11]  Eugene L. Lawler,et al.  Preemptive scheduling of uniform machines subject to release dates : (preprint) , 1979 .

[12]  Peter Brucker,et al.  Open shop problems with unit time operations , 1993, ZOR Methods Model. Oper. Res..

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

[14]  Charles U. Martel,et al.  Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs , 1989, Oper. Res..

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

[16]  Gerhard J. Woeginger,et al.  Minimizing the total completion time in a unit-time open shop with release times , 1997, Oper. Res. Lett..

[17]  T. C. Hu.  Parallel Sequencing and Assembly Line Problems , 1961 .

[18]  Sartaj Sahni,et al.  Preemptive Scheduling with Due Dates , 1979, Oper. Res..

[19]  Vadim G. Timkovsky,et al.  Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity , 2003, Eur. J. Oper. Res..