Name
Abstract | ||
|---|---|---|
The problem of minimizing the completion time variance of n jobs on a single machine has been studied by several authors. We prove the correctness of a 1975 conjecture due to L. Schrage about the position of the third longest job in an optimal schedule. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0167-6377(91)90024-J | Operations Research Letters |
Keywords | Field | DocType |
scheduling | Discrete mathematics,Mathematical optimization,Combinatorics,Scheduling (computing),Correctness,Minification,Minimisation (psychology),Time variance,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
10 | 8 | 0167-6377 |
Citations | PageRank | References |
24 | 3.24 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicholas G. Hall | 1 | 1014 | 119.60 |
| Wieslaw Kubiak | 2 | 540 | 62.61 |