Erratum
Published Online:1 Nov 1982https://doi.org/10.1287/moor.7.4.635
Abstract
In §3 of (Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan. 1981. Minimizing maximum lateness in a two-machine open shop. Math. Oper. Res.6 153–158.) we have given an erroneous proof of the fact that the problem of minimizing maximum lateness in a two-machine open shop when no preemptions are allowed is NP-hard.
