On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines

DOI10.2307/1428135MaRDI QIDQ4850091zbMATH OpenOpenAlexFDO

Authors Gideon Weiss

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

zbMATH Keywords

Gittins priority ruleholding costsstochastic processing times

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Markov and semi-Markov decision processes (90C40)

Recommendations

• Scheduling precedence-constrained jobs with stochastic processing times on parallel machines
• On the optimality of static priority policies in stochastic scheduling on parallel machines
• Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines
• Scheduling preemptive jobs with precedence constraints on parallel machines
• Stochastic identical parallel machine scheduling with OR precedence constraints
• Inequalities and bounds for the scheduling of stochastic jobs on parallel machines
• Optimal preemptive scheduling on a fixed number of identical parallel machines

Cited in

(12)

• List scheduling algorithms to minimize the makespan on identical parallel machines
• Online scheduling for outpatient services with heterogeneous patients and physicians
• Optimal static priority rules for stochastic scheduling with impatience
• Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines
• Probabilistic analysis of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation
• On the optimality of static priority policies in stochastic scheduling on parallel machines
• The optimality of LEPT in parallel machine scheduling
• scientific article; zbMATH DE number 1418273 (Why is no real title available?)
• A tight 2-approximation for preemptive stochastic scheduling
• Coping with Incomplete Information in Scheduling — Stochastic and Online Models
• Technical Note—Stochastic Scheduling with Abandonment: Necessary and Sufficient Conditions for the Optimality of a Strict Priority Policy
• Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling

This page was built for publication: On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4850091)