Optimizing busy time on parallel machines

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.

[1]  Peter Winkler,et al.  Wavelength assignment and generalized interval graph coloring , 2003, SODA '03.

[2]  Thilo Kielmann,et al.  Bag-of-Tasks Scheduling under Budget Constraints , 2010, 2010 IEEE Second International Conference on Cloud Computing Technology and Science.

[3]  Frits C. R. Spieksma,et al.  Interval scheduling: A survey , 2007 .

[4]  Sanjay Ranka,et al.  Energy-efficient dynamic scheduling on parallel machines , 2008, HiPC'08.

[5]  Randeep Bhatia,et al.  Algorithmic Aspects of Bandwidth Trading , 2003, ICALP.

[6]  Vincent Salzgeber,et al.  Making cluster applications energy-aware , 2009, ACDC '09.

[7]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[8]  Elio Salvadori,et al.  A framework for regenerator site selection based on multiple paths , 2010, 2010 Conference on Optical Fiber Communication (OFC/NFOEC), collocated National Fiber Optic Engineers Conference.

[9]  Cynthia A. Phillips,et al.  Off-line admission control for general scheduling problems , 2000, SODA '00.

[10]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[11]  Chaitali Chakrabarti,et al.  Variable voltage task scheduling algorithms for minimizing energy/power , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[12]  S. Raghavan,et al.  The regenerator location problem , 2010 .

[13]  Bo Hong,et al.  Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud , 2010, 2010 IEEE Second International Conference on Cloud Computing Technology and Science.

[14]  Yuval Rabani,et al.  Improved Approximation Algorithms for Resource Allocation , 2002, IPCO.

[15]  Gianpiero Monaco,et al.  On the complexity of the regenerator placement problem in optical networks , 2011, TNET.

[16]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[17]  Fei Wang,et al.  A Task Scheduling Algorithm Based on Load Balancing in Cloud Computing , 2010, WISM.

[18]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[19]  Reuven Bar-Yehuda,et al.  A unified approach to approximating resource allocation and scheduling , 2001, JACM.

[20]  Walter Ludwig,et al.  Algorithms for scheduling malleable and nonmalleable parallel tasks , 1996, Technical Report / University of Wisconsin, Madison / Computer Sciences Department.

[21]  Lap-Kei Lee,et al.  Sleep Management on Multiple Machines for Energy and Flow Time , 2011, ICALP.

[22]  F. Frances Yao,et al.  A scheduling model for reduced CPU energy , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[23]  John Augustine,et al.  Optimal power-down strategies , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[24]  Gianpiero Monaco,et al.  Minimizing total busy time in parallel scheduling with application to optical networks , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[25]  Ulrich M. Schwarz.  Tightness Results for Malleable Task Scheduling Algorithms , 2007, PPAM.

[26]  T. C. Edwin Cheng,et al.  Fixed interval scheduling: Models, applications, computational complexity and algorithms , 2007, Eur. J. Oper. Res..

[27]  Gianpiero Monaco,et al.  Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs , 2008, Euro-Par.

[28]  Refael Hassin,et al.  Allocation of bandwidth and storage , 2002 .

[29]  Gianpiero Monaco,et al.  On the Complexity of the Regenerator Placement Problem in Optical Networks , 2011, IEEE/ACM Transactions on Networking.

[30]  Baruch Schieber,et al.  Minimizing Busy Time in Multiple Machine Real-time Scheduling , 2010, FSTTCS.