Abstract
AbstractWe address the problem of scheduling a set of independent tasks on m parallel and identical machines subject to an arbitrary number of unavailability periods. The objective is to minimize the makespan. The problem was already investigated and was proved to be strongly hard. Moreover, when the number of unavailability periods per machine exceeds 1, there is no bound for the problem. We proved the existence of tight absolute bounds when there is only one unavailability period per machine. In the general case, we proposed an efficient binary linear program and proved that the list algorithm based on the largest processing time (LPT rule) has a high performance. This study was motivated by grid scheduling, where a large number of independent jobs is sent to computing resources whose availability cannot be guaranteed.
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 callMore From: International Transactions in Operational Research
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.
