Article ID: | iaor2009276 |
Country: | Netherlands |
Volume: | 36 |
Issue: | 1 |
Start Page Number: | 61 |
End Page Number: | 66 |
Publication Date: | Jan 2008 |
Journal: | Operations Research Letters |
Authors: | Cheng T.C.E., Ng C.T., Nong Qingqin |
We consider the problem of scheduling family jobs with release dates on a bounded batching machine to minimize the makespan. A polynomial-time approximation scheme for the identical job size model and an approximation algorithm with a worst-case ratio of 5/2 for the non-identical job size model will be derived.