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

• Type: Journal
• Year: 2000
• Where: SIAMCOMP
• Authors: Nah-Oak Song, Demosthenis Teneketzis
• Keywords: AMS Subject Classifications, Machine Minimization, SIAMCOMP 2000, Stochastic Machine Minimization