Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information

DOI10.1287/opre.1080.0660zbMath1233.90180DBLPjournals/ior/CaiWZ09OpenAlexW2031493772WikidataQ62580441 ScholiaQ62580441MaRDI QIDQ3100420

Xianyi Wu, Xian Zhou, Xiaoqiang Cai

Publication date: 24 November 2011

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

Full work available at URL: https://doi.org/10.1287/opre.1080.0660

zbMATH Keywords

dynamic programmingstochastic schedulingsemi-Markov process

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Stochastic scheduling theory in operations research (90B36) Markov and semi-Markov decision processes (90C40)

Related Items (9)

Optimal stopping problems with restricted stopping times ⋮ Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns ⋮ Production planning and pricing policy in a make-to-stock system with uncertain demand subject to machine breakdowns ⋮ A Bayesian approach to the triage problem with imperfect classification ⋮ Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns ⋮ Optimal schedule of elective surgery operations subject to disruptions by emergencies ⋮ The preemptive stochastic resource-constrained project scheduling problem ⋮ Scheduling deteriorating jobs on a single machine subject to breakdowns ⋮ A General Theory of MultiArmed Bandit Processes with Constrained Arm Switches

This page was built for publication: Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information