𝔖 Bobbio Scriptorium
✦   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

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

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