Stochastic Machine Minimization with Constant Service Times

DOI10.1287/MOOR.18.2.300MaRDI QIDQ5287984zbMATH OpenOpenAlexFDO

Authors Paul Wright, E. G. jun. Coffman, L. Flatto

Publication date 5 August 1993

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.18.2.300

zbMATH Keywords

expected number of machinesidentical, parallel machinesnonpreemptive schedulingrandomness of job running times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)

Recommendations

• Optimal Stochastic Allocation of Machines under Waiting-Time Constraints
• The processor minimization problem with independent waiting-time constraints
• Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines

Cited in

(4)

• The processor minimization problem with independent waiting-time constraints
• A Min-Plus Calculus for End-to-End Statistical Service Guarantees
• Optimal Stochastic Allocation of Machines under Waiting-Time Constraints
• On a Conjecture by Coffman, Flatto, and Wright on Stochastic Machine Minimization

This page was built for publication: Stochastic Machine Minimization with Constant Service Times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287984)