Open shop problems with unit time operations

  title={Open shop problems with unit time operations},
  author={P. Brucker and Bernd Jurisch and M. Jurisch},
  journal={Zeitschrift f{\"u}r Operations Research},
  • P. Brucker, Bernd Jurisch, M. Jurisch
  • Published 1993
  • Computer Science
  • Zeitschrift für Operations Research
  • 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
    50 Citations

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    On unit time open shops with additional restrictions
    • T. Tautenhahn
    • Mathematics, Computer Science
    • Math. Methods Oper. Res.
    • 1996
    • 3
    Two-machine shop scheduling with zero and unit processing times
    • 1
    Scheduling Unit-Time Open Shops with Deadlines
    • 6
    The complexity of mean flow time scheduling problems with release times
    • 34
    • PDF
    Shop scheduling problems with multiprocessor tasks on dedicated processors
    • 30


    Unit Execution Time Shop Problems
    • 53
    NP-Complete Scheduling Problems
    • J. Ullman
    • Computer Science
    • J. Comput. Syst. Sci.
    • 1975
    • 1,202
    Some simple scheduling algorithms
    • 434
    A Note On The Complexity Of Openshop Scheduling Problems
    • 44
    Parallel Sequencing and Assembly Line Problems
    • 867