Busy-Time Scheduling on Heterogeneous Machines: Algorithms and Analysis

Abstract

We study a generalized busy-time scheduling model on heterogeneous machines. The input to the model includes a set of jobs and a set of machine types. Each job has a size and a time interval during which it should be processed. Each job is to be placed on a machine for execution. Different types of machines have distinct capacities and cost rates. The total size of the jobs running on a machine must always be kept within the machine's capacity, giving rise to placement restrictions for jobs of various sizes among the machine types. Each machine used is charged according to the time duration in which it is busy, i.e., it is processing jobs. The objective is to schedule the jobs into machines to minimize the total cost of all the machines used. We develop an <inline-formula><tex-math notation="LaTeX">$O(1)$</tex-math></inline-formula> -approximation algorithm in the offline setting and an <inline-formula><tex-math notation="LaTeX">$O(\mu)$</tex-math></inline-formula> -competitive algorithm in the online setting (where <inline-formula><tex-math notation="LaTeX">$\mu$</tex-math></inline-formula> is the max/min job length ratio), both of which are asymptotically optimal. This article significantly improves the analysis of the algorithms over our preliminary work.