Abstract
We study the nonpreemptive parallel machines scheduling problem where some of the machines are planned to be shutdown. We apply LPT algorithm to the problem and analyze its performance. Our analysis shows that the makespan of the LPT schedule is bounded by twice the optimum makespan if no more than half of the machines are allowed to be shutdown simultaneously. We also show that this bound is tight by constructing a worst-case example.
Sign-in/Register to access full text options 
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.
