Stochastic Scheduling with Priority Classes

DOI10.1287/MOOR.23.1.119zbMath0977.90018OpenAlexW2162747078MaRDI QIDQ2757526

R. Garbe, Kevin D. Glazebrook

Publication date: 26 November 2001

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

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

zbMATH Keywords

conservation lawsGittins indexperformance spacebranching banditsuboptimality bounds

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items (4)

An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments ⋮ A confirmation of a conjecture on Feldman’s two-armed bandit problem ⋮ Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation ⋮ An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments

This page was built for publication: Stochastic Scheduling with Priority Classes