| Article ID: | iaor20021189 |
| Country: | China |
| Volume: | 26 |
| Issue: | 4 |
| Start Page Number: | 19 |
| End Page Number: | 21 |
| Publication Date: | Oct 2000 |
| Journal: | Journal of Qufu Normal University |
| Authors: | Ding Jihuan, Liu Lili, Zhang Yuzhong, Jiang Baoshan |
| Keywords: | programming: dynamic |
In this paper, the problem of minimizing the total completion time on a single batch processing machine in the case of two arrival times is discussed. Its NP-Completeness is proved and a polynomial approximation algorithm with performance ratio of 2 is given.