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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
