Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling
From MaRDI portal
Publication:4012780
DOI10.1287/moor.17.2.255zbMath0776.90043MaRDI 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 machines; stochastic scheduling; heuristic; expected weighted flowtime; turnpike optimality; Smith's Rules
90B35: Deterministic scheduling theory in operations research
93E03: Stochastic systems in control theory (general)
Related Items
Un ordonnancement dynamique de tâches stochastiques sur un seul processeur, Bounds and asymptotic results for the uniform parallel processor weighted flow time problem, Multi-armed bandit problem revisited, Frameworks for adaptable scheduling algorithms, Unnamed Item, Unrelated Machine Scheduling with Stochastic Processing Times, Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines, INDEXABILITY OF BANDIT PROBLEMS WITH RESPONSE DELAYS