| Article ID: | iaor20013891 |
| Country: | China |
| Volume: | 15 |
| Issue: | 1 |
| Start Page Number: | 27 |
| End Page Number: | 35 |
| Publication Date: | Mar 2000 |
| Journal: | Chinese Quarterly Journal of Mathematics |
| Authors: | Zhou Xianwei, Du Wen, Li Wenquan |
In this paper, single machine scheduling problems with variable processing time are raised. The criteria of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and so on. The complexity of the problem is determined.