Abstract
We present a ( 3.5 + ɛ ) -approximation algorithm for a scheduling problem on identical parallel machines with the objective to mimimize the makespan. The processing times depend on the usage of a single renewable resource where at any point of time at most k units from the resource are available.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
