Minimizing total busy time in parallel scheduling with application to optical networks

We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J 1 , … , J n }. Each job, J j , is associated with an interval [s j , c j ] along which it should be processed. Also given is the parallelism parameter g ≥ 1, which is the maximal number of jobs that can be processed simultaneously by a single machine. Each machine operates along a contiguous time interval, called its busy interval, which contains all the intervals corresponding to the jobs it processes. The goal is to assign the jobs to machines such that the total busy time of the machines is minimized. The problem is known to be NP-hard already for g = 2. We present a 4-approximation algorithm for general instances, and approximation algorithms with improved ratios for instances with bounded lengths, for instances where any two intervals intersect, and for instances where no interval is properly contained in another. Our study has important application in optimizing the switching costs of optical networks.

[1]  Ori Gerstel,et al.  Cost effective traffic grooming in WDM rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

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

[3]  Ralf Klasing,et al.  Methods and Problems of Wavelength-Routing in All-Optical Networks , 1998 .

[4]  Chunming Qiao,et al.  Fiber-Optic Communication Networks , 2008, Wiley Encyclopedia of Computer Science and Engineering.

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

[6]  Randeep Bhatia,et al.  Algorithmic aspects of bandwidth trading , 2003, TALG.

[7]  M. Shalom,et al.  Minimizing the Number of ADMsWith and Without Traffic Grooming: Complexity and Approximability , 2006, 2006 International Conference on Transparent Optical Networks.

[8]  Shmuel Zaks,et al.  Approximating the Traffic Grooming Problem , 2005, ISAAC.

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

[10]  Maurice Queyranne,et al.  Clique partitioning of interval graphs with submodular costs on the cliques , 2007, RAIRO Oper. Res..

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

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

[13]  A.L. Chiu,et al.  Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.

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

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

[16]  Harold N. Gabow,et al.  An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems , 1983, STOC.

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