| Article ID: | iaor20091009 |
| Country: | Netherlands |
| Volume: | 36 |
| Issue: | 2 |
| Start Page Number: | 157 |
| End Page Number: | 159 |
| Publication Date: | Mar 2008 |
| Journal: | Operations Research Letters |
| Authors: | Kellerer Hans |
We present a (3.5+ϵ)-approximation algorithm for a scheduling problem on identical parallel machines with the objective to minimize the makespan. The processing times depend on the usage of a single renewable resource where at any point of time at most