Multiserver scheduling of jobs with increasing completion rates

DOI10.2307/3213196zbMATH Open0453.90050OpenAlexW2328551575MaRDI QIDQ3901288FDOQ3901288

Authors: J. C. Gittins 

Publication date: 1981

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3213196

zbMATH Keywords

parallel machinesstochastic schedulingHazard raterandom processing timesjobs with increasing completion ratesminimization of expected flow timemultiserver schedulingoptimal processing strategy

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (2)

• Stochastic scheduling on parallel machines to minimize discounted holding costs
• Stochastic programming approaches to stochastic scheduling

This page was built for publication: Multiserver scheduling of jobs with increasing completion rates

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