Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling
From MaRDI portal
Publication:4012780
DOI10.1287/moor.17.2.255zbMath0776.90043OpenAlexW2104709390MaRDI QIDQ4012780
Publication date: 27 September 1992
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/77760fb2d937b20220b84fb2b2462acb314c137b
parallel machinesstochastic schedulingheuristicexpected weighted flowtimeturnpike optimalitySmith's Rules
Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)
Related Items
Multi-armed bandit problem revisited, Unnamed Item, Unrelated Machine Scheduling with Stochastic Processing Times, Frameworks for adaptable scheduling algorithms, INDEXABILITY OF BANDIT PROBLEMS WITH RESPONSE DELAYS, Un ordonnancement dynamique de tâches stochastiques sur un seul processeur, Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines, Bounds and asymptotic results for the uniform parallel processor weighted flow time problem