Voir la notice de l'article provenant de la source Numdam
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.
Mondal, Sakib A. 1
@article{RO_2018__52_2_371_0, author = {Mondal, Sakib A.}, title = {Resource allocation problem under single resource assignment}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {371--382}, publisher = {EDP-Sciences}, volume = {52}, number = {2}, year = {2018}, doi = {10.1051/ro/2017035}, zbl = {1400.68262}, mrnumber = {3817471}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2017035/} }
TY - JOUR AU - Mondal, Sakib A. TI - Resource allocation problem under single resource assignment JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2018 SP - 371 EP - 382 VL - 52 IS - 2 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ro/2017035/ DO - 10.1051/ro/2017035 LA - en ID - RO_2018__52_2_371_0 ER -
%0 Journal Article %A Mondal, Sakib A. %T Resource allocation problem under single resource assignment %J RAIRO - Operations Research - Recherche Opérationnelle %D 2018 %P 371-382 %V 52 %N 2 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ro/2017035/ %R 10.1051/ro/2017035 %G en %F RO_2018__52_2_371_0
Mondal, Sakib A. Resource allocation problem under single resource assignment. RAIRO - Operations Research - Recherche Opérationnelle, Tome 52 (2018) no. 2, pp. 371-382. doi: 10.1051/ro/2017035
Cité par Sources :