| Article ID: | iaor20102852 |
| Volume: | 36 |
| Issue: | 4 |
| Start Page Number: | 477 |
| End Page Number: | 480 |
| Publication Date: | Jul 2008 |
| Journal: | Operations Research Letters |
| Authors: | Yuan Jinjiang, Lu Lingfa |
We consider unbounded parallel batch scheduling with job delivery to minimize makespan. When the jobs have identical size, we provide a polynomial-time algorithm. When the jobs have non-identical sizes, we provide a heuristic with a worst-case performance ratio 7/4.