On the optimality of static priority policies in stochastic scheduling on parallel machines

DOI10.2307/3214267zbMath0632.90032OpenAlexW2319913714MaRDI QIDQ3770268

Thomas Kämpke

Publication date: 1987

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

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

zbMATH Keywords

exponential distributionexpected weighted flowtimemachine idlenessMarkovian cost functionpreemptive and non-preemptive schedulingpriority policies

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Scheduling jobs on heterogeneous processors ⋮ General stochastic single-machine scheduling with regular cost functions ⋮ When greediness fails: examples from stochastic scheduling. ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ Approximation results in parallel machines stochastic scheduling ⋮ Analysis of Smith's rule in stochastic machine scheduling ⋮ Stochastic scheduling on parallel machines to minimize discounted holding costs ⋮ Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines ⋮ Stochastic Online Scheduling Revisited

This page was built for publication: On the optimality of static priority policies in stochastic scheduling on parallel machines