| Article ID: | iaor19981391 |
| Country: | Netherlands |
| Volume: | 17 |
| Issue: | 3 |
| Start Page Number: | 127 |
| End Page Number: | 129 |
| Publication Date: | Apr 1995 |
| Journal: | Operations Research Letters |
| Authors: | Chen Zhi-Long |
| Keywords: | scheduling |
We consider a single-processor scheduling model where the execution time of a task is a decreasing linear function of its starting time. The complexity of the problem of minimizing the number of late tasks remains unknown for a set of tasks with identical due dates. We present an O(