Improved Algorithm for Resource Allocation Problems

Sakib A. Mondal ()
Additional contact information
Sakib A. Mondal: Walmart Labs, Salarpuria Hallmark, Bengaluru, Karnataka 560103, India

Asia-Pacific Journal of Operational Research (APJOR), 2018, vol. 35, issue 01, 1-23

Abstract: We consider the problem of allocating a set of resources for performing a given collection of jobs. Each of the jobs has specific resource requirement for its execution. Each resource has specific start time, finish time and associated cost per unit usage. The objective is to execute the jobs while incurring minimum cost. The problem is NP-hard. We improve known four-approximation to a three-approximation algorithm. Our algorithm implies better approximation for two other related problems.

Keywords: Primal dual; approximation; scheduling; integer linear programing (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595918500069
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:35:y:2018:i:01:n:s0217595918500069

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595918500069

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().