Abstract
Abstract In Allaoui H., Artiba A., Elmaghraby S.E., Riane F., 2006. Scheduling of a two-machine flowshop with availability constraints on the first machine. International Journal of Production Economics 99, 16–27, two conditions of optimality for the Johnson sequence are given. We establish in this note that these conditions are false, under the resumable and the non-resumable case. We also point out two incorrect proofs and give evidence that the time complexity of their dynamic approach is very unlikely to be correct.
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.
