On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines
From MaRDI portal
Publication:4850091
DOI10.2307/1428135zbMath0829.60084MaRDI 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
90B35: Deterministic scheduling theory in operations research
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
90C40: Markov and semi-Markov decision processes
Related Items
A Tight 2-Approximation for Preemptive Stochastic Scheduling, Coping with Incomplete Information in Scheduling — Stochastic and Online Models, List scheduling algorithms to minimize the makespan on identical parallel machines, Online scheduling for outpatient services with heterogeneous patients and physicians