Online Optimization of Busy Time on Parallel Machines

Abstract

Abstract. 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. 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.

Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms

“…The authors proposed a constant-factor approximation algorithm with ratio ln (w · k ) , where w is the maximum allowed number of hops for any lightpath. Additionally, Mertzios, Shalom, Wong, andShalom, Voloshin, Wong, Yung, and studied the regenerator placement in an online setting.…”

Energy Saving Virtual Machine Allocation in Cloud Computing

“…It optimized the maximum rates at which jobs can be processed in the system. In addition, the VM scheduling is closely relative to the fixed interval scheduling [9]- [13], [20]. The existing works on the fixed interval scheduling problem aim for minimizing the number of machines to accommodate all jobs, minimizing the job completion time, minimizing the cost of scheduling all jobs, maximizing the profit of a selected subsets of jobs and so on [11].…”