Abstract
For a scheduling problem to minimize the makespan on parallel machines, we consider schedules with at most one preemption. We show that in the case of two uniform machines the problem is solvable in polynomial time. For m≥3 uniform parallel machines, we measure the quality of a single preemption as the worst-case ratio of the makespan of an optimal schedule with at most one preemption over the makespan of an optimal preemptive schedule. We show that the global bound on such a ratio is 2−2∕m.
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.
