Abstract
We consider the rescheduling on a single machine with release dates to minimize the makespan and total sequence disruption simultaneously. In the literature, a polynomial-time algorithm was presented for minimizing the makespan under a limit on the total sequence disruption. But the algorithm is not strongly polynomial. We present a strongly polynomial-time algorithm for finding all Pareto optimal points of the Pareto optimization problem. Consequently, the rescheduling to minimize the makespan under a limit on the total sequence disruption can be solved in a strongly polynomial time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.