Abstract
Given a time slotted list of resource capacities, we address the problem of scheduling resource allocation considering that a change in allocation results in the changeover penalty of one timeslot. The goal is to maximize the overall allocation of resources. We prove that no 1 -lookahead algorithm can be better than 8 5 -competitive. We provide improved analysis of Wait Dominate Hold (WDH) algorithm that was previously known to be 4 -competitive. We prove that WDH is 8 3 -competitive. We also consider k -lookahead algorithms, and prove lower bound of ( k + 2 ) / ( k + 1 ) on their competitiveness and give an online algorithm that is 2 -competitive.
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.
