Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well-known NP-hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optima
β¦ LIBER β¦
Proof of a conjecture of Schrage about the completion time variance problem
β Scribed by Nicholas G. Hall; Wieslaw Kubiak
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 299 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Probabilistic analysis of an asymptotica
β
C.T. Ng; X. Cai; T.C.E. Cheng
π
Article
π
1999
π
John Wiley and Sons
π
English
β 135 KB
π 2 views
Proof of a conjecture by ErdΕs and Graha
β
Jacques Dixmier
π
Article
π
1990
π
Elsevier Science
π
English
β 487 KB
Minimizing the average deviation of job
β
John J. Kanet
π
Article
π
1981
π
John Wiley and Sons
π
English
β 403 KB
The essential spectrum of a model proble
β
M. Faierman; R. Mennicken; M. MΓΆller
π
Article
π
2004
π
John Wiley and Sons
π
English
β 254 KB
## Abstract Descloux and Geymonat considered a model problem for plasma in a toroidal configuration and conjectured that the essential spectrum has an explicitly given band structure. Here we prove this conjecture by employing an operator matrix representation of the problem. (Β© 2004 WILEYβVCH Verl
On the form of solutions to the linear c
β
Benedikt JΓ³hannesson; Morgan A Hanson
π
Article
π
1985
π
Elsevier Science
π
English
β 263 KB
Minimizing the average deviation of job
β
T.C.E. Cheng
π
Article
π
1987
π
Elsevier Science
β 180 KB