Un ordonnancement dynamique de tâches stochastiques sur un seul processeur

DOI10.1051/RO:2003010zbMath1037.90036OpenAlexW2123731350MaRDI QIDQ4457894

Ali Derbala

Publication date: 17 March 2004

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2002__36_4_365_0

zbMATH Keywords

bandit processesGittins indices

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for evaluating the dynamic allocation index
• Myopic strategies for Bayesian models in stochastic scheduling
• Scheduling for Minimum Total Loss Using Service Time Distributions
• Optimal strategies for families of alternative bandit processes
• Scheduling Deteriorating Jobs on a Single Processor
• Evaluating the effects of machine breakdowns in stochastic scheduling problems
• Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling
• Stochastic scheduling with order constraints
• On Bayesian models in stochastic scheduling

This page was built for publication: Un ordonnancement dynamique de tâches stochastiques sur un seul processeur