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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.