Submodular Returns and Greedy Heuristics for Queueing Scheduling Problems

DOI10.1287/opre.46.3.336zbMath0996.90048OpenAlexW2022413371MaRDI QIDQ2781095

R. Garbe, Kevin D. Glazebrook

Publication date: 31 July 2002

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

Full work available at URL: https://doi.org/10.1287/opre.46.3.336

zbMATH Keywords

reducibilityconservation lawsallocationgreedy heuristicslinear objectivescontrolled stochastic systems

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Stochastic scheduling theory in operations research (90B36)

Related Items (3)

Multi-period job selection: Planning work loads to maximize profit ⋮ Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation ⋮ Stochastic programming approaches to stochastic scheduling

This page was built for publication: Submodular Returns and Greedy Heuristics for Queueing Scheduling Problems