Sciweavers

Share
SIAMCOMP
2000

On a Conjecture by Coffman, Flatto, and Wright on Stochastic Machine Minimization

9 years 5 months ago
On a Conjecture by Coffman, Flatto, and Wright on Stochastic Machine Minimization
We investigate a conjecture stated by Coffman, Flatto, and Wright within the context of a stochastic machine minimization problem with a hard deadline. We prove that the conjecture is true. Key words. stochastic allocation, hard deadlines, machine minimization, Bellman equation, time thresholds AMS subject classifications. 93E20, 93E03, 90C39 PII. S0097539797324643
Nah-Oak Song, Demosthenis Teneketzis
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2000
Where SIAMCOMP
Authors Nah-Oak Song, Demosthenis Teneketzis
Comments (0)
books