Stochastic scheduling subject to preemptive-repeat breakdowns with incomplete information

DOI10.1287/OPRE.1080.0660MaRDI QIDQ3100420zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Xiaoqiang Cai, Xianyi Wu, Xian Zhou

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 programmingsemi-Markov processstochastic scheduling

Mathematics Subject Classification ID

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

Recommendations

• Stochastic scheduling subject to machine breakdowns: The preemptive-repeat model with discounted reward and other criteria
• A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown–The Preemptive Repeat Model
• STOCHASTIC SCHEDULING WITH PREEMPTIVE-REPEAT MACHINE BREAKDOWNS TO MINIMIZE THE EXPECTED WEIGHTED FLOW TIME
• On Nonpreemptive Policies for Stochastic Single-Machine Scheduling with Breakdowns
• Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities

Cited in

(14)

• A general theory of multiarmed bandit processes with constrained arm switches
• Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns
• Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns
• Stochastic single-machine scheduling with workload-dependent maintenance activities
• Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling
• A Bayesian approach to the triage problem with imperfect classification
• Optimal stopping problems with restricted stopping times
• Production planning and pricing policy in a make-to-stock system with uncertain demand subject to machine breakdowns
• Scheduling deteriorating jobs on a single machine subject to breakdowns
• Coping with Incomplete Information in Scheduling — Stochastic and Online Models
• The preemptive stochastic resource-constrained project scheduling problem
• Replication and sequencing of unreliable jobs on m parallel machines: new results
• Customer scheduling with incomplete information
• Optimal schedule of elective surgery operations subject to disruptions by emergencies

This page was built for publication: Stochastic scheduling subject to preemptive-repeat breakdowns with incomplete information

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