Resource allocation with time intervals

  • Authors:

  • Andreas Darmann;Ulrich Pferschy;Joachim Schauer

  • Affiliations:

  • University of Graz, Institute of Public Economics, Universitaetsstr. 15, 8010 Graz, Austria;University of Graz, Department of Statistics and Operations Research, Universitaetsstr. 15, 8010 Graz, Austria;University of Graz, Department of Statistics and Operations Research, Universitaetsstr. 15, 8010 Graz, Austria

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2010

Quantified Score

Hi-index 5.23

Visualization

Abstract

We study a resource allocation problem where jobs have the following characteristic: each job consumes some quantity of a bounded resource during a certain time interval and induces a given profit. We aim to select a subset of jobs with maximal total profit such that the total resource consumed at any point in time remains bounded by the given resource capacity. While this case is trivially NP-hard in general and polynomially solvable for uniform resource consumptions, our main result shows the NP-hardness for the case of general resource consumptions but uniform profit values, i.e. for the case of maximizing the number of performed jobs. This result applies even for proper time intervals. We also give a deterministic (1/2-@e)-approximation algorithm for the general problem on proper intervals improving upon the currently known 1/3 ratio for general intervals. Finally, we study the worst-case performance ratio of a simple greedy algorithm.