| Issue |
RAIRO-Oper. Res.
Volume 52, Number 2, April–June 2018
|
|
|---|---|---|
| Page(s) | 371 - 382 | |
| DOI | https://doi.org/10.1051/ro/2017035 | |
| Published online | 31 May 2018 | |
Resource allocation problem under single resource assignment
Data Science, Flipkart Internet Private Limited, Cessna Business Park Embassy Tech Square, Outer Ring Road,
Bengaluru,
Karnataka
560103 India
* Corresponding author: sakib@hotmail.com
Received:
4
January
2017
Accepted:
6
May
2017
We consider a NP-hard resource allocation problem of allocating a set of resources to meet demands over a time period at the minimum cost. Each resource has a start time, finish time, availability and cost. The objective of the problem is to assign resources to meet the demands so that the overall cost is minimum. It is necessary that only one resource contributes to the demand of a slot. This constraint will be referred to as single resource assignment (SRA) constraint. We would refer to the problem as the S_RA problem. So far, only 16-approximation to this problem is known. In this paper, we propose an algorithm with approximation ratio of 12.
Mathematics Subject Classification: 68W25 / 90B35 / 68R01
Key words: Resource allocation / scheduling / primal dual
© EDP Sciences, ROADEF, SMAI 2018
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.