Open shop problems with unit time operations

@article{Brucker1993OpenSP,
  title={Open shop problems with unit time operations},
  author={Peter Brucker and Bernd Jurisch and Marion Jurisch},
  journal={Zeitschrift f{\"u}r Operations Research},
  year={1993},
  volume={37},
  pages={59-73}
}
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… CONTINUE READING

Figures, Tables, and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 27 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 27 REFERENCES

Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness

Peter Brucker, Michael Randolph Garey, David S. Johnson
  • Math. Oper. Res.
  • 1977
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

A polynomial time algorithm for a 2-machine open shop problem with precedence constraints and unit processing times, Preprint

H Brsel, D Kluge, F Werner
  • Technische Universit~it Otto von Guericke,
  • 1992
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Two-Processor Scheduling with Start-Times and Deadlines

Michael Randolph Garey, David S. Johnson
  • SIAM J. Comput.
  • 1977
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Unit Execution Time Shop Problems

  • Math. Oper. Res.
  • 1982
VIEW 2 EXCERPTS