Resource cost aware scheduling

Rodrigo A. Carrasco, Garud Iyengar, Cliff Stein

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

6 Citas (Scopus)

Resumen

We are interested in the scheduling problem where there are several different resources that determine the speed at which a job runs and we pay depending on the amount of each resource that we use. This work is an extension of the resource dependent job processing time problem and the energy aware scheduling problems. We develop a new constant factor approximation algorithm for resource cost aware scheduling problems: the objective is to minimize the sum of the total cost of resources and the total weighted completion time in the one machine non-preemptive setting, allowing for arbitrary precedence constraints and release dates. Our algorithm handles general job-dependent resource cost functions. We also analyze the practical performance of our algorithms, showing that it is significantly superior to the theoretical bounds and in fact it is very close to optimal. The analysis is done using simulations and real instances, which are left publicly available for future benchmarks. We also present additional heuristic improvements and we study their performance in other settings.

Idioma originalInglés
Páginas (desde-hasta)621-632
Número de páginas12
PublicaciónEuropean Journal of Operational Research
Volumen269
N.º2
DOI
EstadoPublicada - 1 sept. 2018

Huella

Profundice en los temas de investigación de 'Resource cost aware scheduling'. En conjunto forman una huella única.

Citar esto