IMDEA Networks Institute Publications Repository

Interval scheduling to maximize bandwidth provision

Shalom, Mordechai and Wong, Prudence W. H. and Zaks, Shmuel (2013) Interval scheduling to maximize bandwidth provision. In: The 11th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2013), 23 - 28 June 2013 , Abbaye des Prémontrés, Pont à Mousson, France.

PDF ( Interval scheduling to maximize bandwidth provision) - Published Version
Download (68Kb) | Preview


We study an interval scheduling problem in which each job j is associated with a time interval Ij, a minimum aj and maximum bj required bandwidths, and a weight wj. We are given W colors. We need to assign to each job j between aj and bj colors, such that each color is assigned at each time to at most one interval. The weighted bandwidth allocated to job j is the number of colors allocated to it times |Ij|, and the weighted bandwidth of a coloring is the sum of the weighted bandwidth of all jobs. The objective is to find a coloring with maximum weighted bandwidth. A coloring is (circularly) contiguous if the set of colors for each job forms an (circular) interval.

Item Type: Conference or Workshop Papers (Paper)
Depositing User: Rebeca De Miguel
Date Deposited: 02 Dec 2013 05:03
Last Modified: 23 Apr 2014 12:17

Actions (login required)

View Item View Item