Open shop problems with unit time operations

We show that them-machine open shop problem in which all operations have unit processing times can be polynomially transformed to a special preemptive scheduling problem onm identical parallel machines. Many results published recently as well as some new results are derived by using this transformation. The new results include solutions of open problems mentioned in a recent paper by Kubiak et al. p]A similar relationship is derived between no-wait open shop problems with unit time operations andm-machine problems with jobs having unit processing times.

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

[2]  Kevin Mahon,et al.  Deterministic and Stochastic Scheduling , 1983 .

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

[4]  Teofilo F. Gonzalez,et al.  A New Algorithm for Preemptive Scheduling of Trees , 1980, JACM.

[5]  E. L. Lawler,et al.  Preemptive Scheduling of. Precedence-Constrained Jobs on Parallel Machines , 1981 .

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

[7]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

[8]  Frank Werner,et al.  A polynomial algorithm for the [n/m/0, tij = 1, tree/Cmax] open shop problem , 1994 .

[9]  David S. Johnson,et al.  Scheduling Tasks with Nonuniform Deadlines on Two Processors , 1976, J. ACM.

[10]  Edward G. Coffman,et al.  Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems , 1970, JACM.

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

[12]  Clyde L. Monma.  The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions , 1979, Oper. Res..

[13]  Edward G. Coffman,et al.  Optimal Preemptive Scheduling on Two-Processor Systems , 1969, IEEE Transactions on Computers.

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

[15]  Harold N. Gabow,et al.  Algorithms for Edge Coloring Bipartite Graphs and Multigraphs , 1982, SIAM J. Comput..

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

[17]  David S. Johnson,et al.  Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..

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

[19]  A. Trayse,et al.  ALGORITHMS FOR MINIMAL-LENGTH SCHEDULES , 1979 .

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

[21]  R. L. Bulfin,et al.  Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates , 1988, Oper. Res..

[22]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[23]  H. Bräsel,et al.  A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree Constraints , 1995, Discret. Appl. Math..

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

[25]  Teofilo F. Gonzalez,et al.  Unit Execution Time Shop Problems , 1982, Math. Oper. Res..