Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

Optimizing busy time on parallel machines.

Mertzios, G.B. and Shalom, M. and Voloshin, A. and Wong, P.W.H. and Zaks, S. (2015) 'Optimizing busy time on parallel machines.', Theoretical computer science., 562 . pp. 524-541.

Abstract

We consider the following fundamental parallel machines scheduling problem in which the input consists of n jobs to be scheduled on a set of identical machines of bounded capacity g, which is the maximal number of jobs that can be processed simultaneously by a single machine. Each job is associated with a time interval during which it should be processed from start to end (and in one of our extensions it has to be scheduled also in a continuous number of days; this corresponds to a two-dimensional variant of the problem). We consider two versions of the problem. In the scheduling 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 can be scheduled for processing under a budget constraint given in terms of busy time. This is the first study of the maximization version of the problem. The minimization problem is known to be NP-Hard, thus the maximization problem is also NP-Hard. We consider various special cases, identify cases where an optimal solution can be computed in polynomial time, and mainly provide constant factor approximation algorithms for both minimization and maximization problems. Some of our results improve upon the best known results for this job scheduling problem. Our study has applications in energy-aware scheduling, cloud computing, switching cost optimization as well as wavelength assignments in optical networks.

Item Type:Article
Keywords:Interval scheduling, Busy time, Resource allocation, Approximation algorithms.
Full text:(AM) Accepted Manuscript
Download PDF
(250Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1016/j.tcs.2014.10.033
Publisher statement:NOTICE: this is the author’s version of a work that was accepted for publication in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Theoretical Computer Science, 562, 11 January 2015, 10.1016/j.tcs.2014.10.033.
Date accepted:No date available
Date deposited:06 November 2014
Date of first online publication:January 2015
Date first made open access:No date available

Save or Share this output

Export:
Export
Look up in GoogleScholar