| Article ID: | iaor20071195 |
| Country: | China |
| Volume: | 31 |
| Issue: | 3 |
| Start Page Number: | 10 |
| End Page Number: | 12 |
| Publication Date: | Jul 2005 |
| Journal: | Journal of Qufu Normal University |
| Authors: | Zhang Yuzhong, Zhang Xin, Liu Jingzhao |
The authors consider the problems of scheduling jobs with non-identical capacity requirements or sizes on parallel identical batch processors to minimize the makespan. They provide an approximation algorithm PM, and obtain an upeer bound on its performance ratio.