On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines
From MaRDI portal
Publication:4850091
DOI10.2307/1428135zbMath0829.60084OpenAlexW2320338423MaRDI QIDQ4850091
Publication date: 15 January 1996
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1428135
Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)
Related Items
List scheduling algorithms to minimize the makespan on identical parallel machines, Coping with Incomplete Information in Scheduling — Stochastic and Online Models, Online scheduling for outpatient services with heterogeneous patients and physicians, A Tight 2-Approximation for Preemptive Stochastic Scheduling