Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Improved algorithms for resource allocation under varying capacity

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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Scheduling Springer Journals

Improved algorithms for resource allocation under varying capacity

Download PDF
13 pages

Loading next page...
 
/lp/springer_journal/improved-algorithms-for-resource-allocation-under-varying-capacity-HJxiwybiF8
Publisher
Springer Journals
Copyright
Copyright © 2017 by Springer Science+Business Media New York
Subject
Business and Management; Operations Research/Decision Theory; Calculus of Variations and Optimal Control; Optimization; Optimization; Artificial Intelligence (incl. Robotics); Supply Chain Management
ISSN
1094-6136
eISSN
1099-1425
DOI
10.1007/s10951-017-0515-3
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Journal of Scheduling – Springer Journals

Published: Feb 16, 2017

References

  • Label placement by maximum independent set in rectangles
    Agarwal, P; Kreveld, M; Suri, S
  • A unified approach to approximating resource allocation and scheduling
    Bar-Noy, A; Bar-Yehuda, R; Freund, A; Naor, J; Schieber, B
  • Approximating the throughput of multiple machines in real-time scheduling
    Bar-Noy, A; Guha, S; Noar, J; Schieber, B
  • Multi-phase algorithms for throughput maximization for real-time scheduling
    Berman, P; Dasgupta, B
  • Approximation algorithms for the unsplittable flow problem
    Chakrabarti, A; Chekuri, C; Gupta, A; Kumar, A
  • Interval selection: Applications, algorithms, and lower bounds
    Erlebach, T; Spieksma, F
  • Optimal packing and covering in the plane are NP-complete
    Fowler, R; Paterson, M; Tanimoto, S
  • Handbook of approximation algorithms and metaheuristics
    Kolliopoulos, S
  • Fast primal-dual distributed algorithms for scheduling and matching problems
    Panconesi, A; Sozio, M
  • On the approximability of an interval scheduling problem
    Spieksma, F
  • Elimination graphs
    Ye, Y; Borodin, A