Improved algorithms for resource allocation under varying capacity

We consider the problem of scheduling a set of jobs on a system that offers certain resource, wherein the amount of resource offered varies over time. For each job, the input specifies a set of possible scheduling instances, where each instance is given by starting time, ending time, profit and resource requirement. A feasible solution selects a subset of job instances such that at any timeslot, the total requirement by the chosen instances does not exceed the resource available at that timeslot, and at most one instance is chosen for each job. The above problem falls under the well-studied framework of unsplittable flow problem on line. The generalized notion of scheduling possibilities captures the standard setting concerned with release times and deadlines. We present improved algorithms based on the primal–dual paradigm, where the improvements are in terms of approximation ratio, running time and simplicity.

[1]  Rafail Ostrovsky,et al.  Approximation algorithms for the job interval selection problem and related scheduling problems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[2]  Paul S. Bonsma,et al.  A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths , 2011, FOCS.

[3]  Khaled M. Elbassioni,et al.  Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees , 2012, FSTTCS.

[4]  Nikhil Bansal,et al.  A logarithmic approximation for unsplittable flow on line graphs , 2014, TALG.

[5]  Andreas Wiese,et al.  Submodular unsplittable flow on trees , 2016, IPCO.

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

[7]  Sanjeev Khanna,et al.  On approximating rectangle tiling and packing , 1998, SODA '98.

[8]  Anamitra R. Choudhury,et al.  A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints , 2010, FSTTCS.

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

[10]  Anamitra R. Choudhury,et al.  Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform Bandwidths , 2013, IPDPS.

[11]  Rafail Ostrovsky,et al.  Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems , 2006, Math. Oper. Res..

[12]  Baruch Schieber,et al.  A quasi-PTAS for unsplittable flow on line graphs , 2006, STOC '06.

[13]  Yogish Sabharwal,et al.  Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform Bandwidths , 2013, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing.

[14]  Yogish Sabharwal,et al.  Varying bandwidth resource allocation problem with bag constraints , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[15]  Sudipto Guha,et al.  Approximating the Throughput of Multiple Machines in Real-Time Scheduling , 2002, SIAM J. Comput..

[16]  Andreas Wiese,et al.  Approximation Schemes for Maximum Weight Independent Set of Rectangles , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[17]  Piotr Berman,et al.  Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling , 2000, J. Comb. Optim..

[18]  Amit Kumar,et al.  Approximation Algorithms for the Unsplittable Flow Problem , 2002, Algorithmica.

[19]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[20]  Parinya Chalermsook,et al.  Maximum independent set of rectangles , 2009, SODA.

[21]  Fabrizio Grandoni,et al.  Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path , 2013, IPCO.

[22]  Stavros G. Kolliopoulos.  Edge-Disjoint Paths and Unsplittable Flow , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[23]  Fabrizio Grandoni,et al.  A Mazing 2+∊ Approximation for Unsplittable Flow on a Path , 2014, SODA.

[24]  Chandra Chekuri,et al.  Multicommodity demand flow in a tree and packing integer programs , 2007, TALG.

[25]  Allan Borodin,et al.  Elimination graphs , 2009, TALG.

[26]  Frits C. R. Spieksma,et al.  Interval selection: Applications, algorithms, and lower bounds , 2003, J. Algorithms.

[27]  Subhash Suri,et al.  Label placement by maximum independent set in rectangles , 1998, CCCG.

[28]  Fabrizio Grandoni,et al.  Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows , 2015, WAOA.

[29]  Chandra Chekuri,et al.  Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs , 2009, APPROX-RANDOM.

[30]  F. Spieksma.  On the approximability of an interval scheduling problem , 1999 .

[31]  Alessandro Panconesi,et al.  Fast primal-dual distributed algorithms for scheduling and matching problems , 2010, Distributed Computing.

[32]  Akcoglu Karhan,et al.  Opportunity Cost Algorithms for Combinatorial Auctions , 2000 .