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

DOI10.1051/RO:2003010zbMATH Open1037.90036OpenAlexW2123731350MaRDI QIDQ4457894FDOQ4457894

Authors: 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

Recommendations

• Dynamic scheduling of stochastic jobs on a single machine
• A stochastic single machine scheduling with random processing time
• Single-machine stochastic scheduling with dependent processing times
• On the scheduling of alternative stochastic jobs on a single machine
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
• Single machine scheduling with stochastically dependent times
• Time complexity of single machine scheduling with stochastic precedence constraints
• Single-machine scheduling to stochastically minimize maximum lateness

zbMATH Keywords

Gittins indicesbandit processes

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• An index policy for a stochastic scheduling model with improving/deteriorating jobs
• Scheduling In the random-order model
• Dynamic scheduling of stochastic jobs on a single machine
• A note on the optimality of index priority rules for search and sequencing problems

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

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