| Article ID: | iaor20081723 |
| Country: | China |
| Volume: | 26 |
| Issue: | 4 |
| Start Page Number: | 451 |
| End Page Number: | 456 |
| Publication Date: | Jul 2006 |
| Journal: | Journal of Mathematics |
| Authors: | Gao Chengxiu, Yan Peisheng, Deng Wei |
In this paper, we discuss single machine scheduling with assignable due dates to minimize number of tardy tasks in batch processing. For all these models, we either give the optimal schedules, or prove that they are NP-hard questions.