Resource cost aware scheduling

Abstract

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.

Publication
European Journal of Operational Research
Rodrigo A. Carrasco
Rodrigo A. Carrasco
Academic Director Master in Industrial Engineering / Assistant Professor
Garud Iyengar
Garud Iyengar
Columbia University
Cliff Stein
Cliff Stein
Columbia University

Related