| Article ID: | iaor20053068 |
| Country: | China |
| Volume: | 19A |
| Issue: | 2 |
| Start Page Number: | 241 |
| End Page Number: | 245 |
| Publication Date: | Jun 2004 |
| Journal: | Applied Mathematics |
| Authors: | Feng Zhang |
This paper studies the scheduling with controllable processing times. The objective function to be discussed is the number of late jobs plus maximal compress rate of processing times. A polynomial time algorithm is presented to solve this problem.