Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods
Mahjoub A., Kaabi J., Harrath Y.
PublisherBlackwell Publishing Ltd
SourcetitleInternational Transactions in Operational Research
We 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 (Formula presented.) 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. � 2018 The Authors. International Transactions in Operational Research � 2018 International Federation of Operational Research Societies