@article{Brucker1993OpenSP,
title={Open shop problems with unit time operations},
author={P. Brucker and Bernd Jurisch and M. 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