We consider the following online scheduling problem in which the input consists of n jobs to be scheduled on identical machines of bounded capacity g (the maximum number of jobs that can be processed simultaneously on a single machine). Each job is associated with a release time and a completion time between which it is supposed to be processed. When a job is released, the online algorithm has to make decision without changing it afterwards. A machine is said to be busy at a certain time if there is at least one job processing on the machine at that time. We consider two versions of the problem. In the minimization version, the goal is to minimize the total busy time of machines used to schedule all jobs. In the resource allocation maximization version, the goal is to maximize the number of jobs that are scheduled under a budget constraint given in terms of busy time. This is the first study on online algorithms for these problems. We show a rather large lower bound on the competitive ratio for general instances. This motivates us to consider special families of input instances for which we show constant competitive algorithms. Our study has applications in power-aware scheduling, cloud computing and optimizing switching cost of optical networks.
Shalom, M., Voloshin, A., Wong, P. W. H., Yung, F. C. C., & Zaks, S. (2014). Online optimization of busy time on parallel machines. Theoretical Computer Science, 560(P2), 190–206. https://doi.org/10.1016/j.tcs.2014.07.017