Name
Abstract | ||
|---|---|---|
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(n^2)-time dynamic programming algorithm for solving this problem. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1016/0167-6377(94)00058-E | Oper. Res. Lett. |
Keywords | Field | DocType |
linear function,execution time,identical due date,scheduling,time-dependent execution time,time dynamic programming algorithm,polynomial-time algorithm,late task,single-processor scheduling model,single-processor,dynamic programming,dynamic programming algorithm | Dynamic programming,Mathematical optimization,Scheduling (computing),Execution time,Processor scheduling,Dynamic priority scheduling,Linear function,Time complexity,Foreground-background,Mathematics | Journal |
Volume | Issue | ISSN |
17 | 3 | Operations Research Letters |
Citations | PageRank | References |
17 | 3.32 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhi-Long Chen | 1 | 414 | 26.32 |