| Article ID: | iaor20052164 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 2 |
| Start Page Number: | 157 |
| End Page Number: | 164 |
| Publication Date: | Mar 2005 |
| Journal: | Operations Research Letters |
| Authors: | Li Shuguang, Li Guojun, Wang Xiaoli, Liu Qiming |
| Keywords: | heuristics |
We consider the problem of scheduling jobs with release times and non-identical job sizes on a single batching machine; our objective is to minimize makespan. We present an approximation algorithm with worst-case ratio 2+ϵ, where ϵ>0 can be made arbitrarily small.