Abstract
We show by counterexample that the binary integer quadratic programming model proposed by Kaabi and Harrath [2019. “Scheduling on Uniform Parallel Machines with Periodic Unavailability Constraints.” International Journal of Production Research 57: 216–227] is incorrect. We fix this model and propose two linear ones.
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.
