A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair
From MaRDI portal
Publication:3415869
DOI10.1017/S0269964800000619zbMath1134.90410MaRDI QIDQ3415869
Elias Rammouz, Michael L. Pinedo
Publication date: 19 January 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Related Items (19)
Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns ⋮ Using information about machine failures to control flowlines ⋮ Selecting jobs for scheduling on a machine subject to failure ⋮ Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities ⋮ Two machine scheduling under disruptions with transportation considerations ⋮ On the mass COVID-19 vaccination scheduling problem ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ Optimal activation of halting multi‐armed bandit models ⋮ Single machine scheduling under potential disruption ⋮ Group scheduling with learning effect and random processing time ⋮ A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures ⋮ Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance ⋮ Scheduling deteriorating jobs on a single machine subject to breakdowns ⋮ Stochastic single machine scheduling with an exponentially distributed due date ⋮ Single-machine scheduling with maintenance and repair rate-modifying activities ⋮ On stochastic machine scheduling with general distributional assumptions ⋮ Order assignment and scheduling under processing and distribution time uncertainty ⋮ Minimizing makespan on a single machine subject to random breakdowns ⋮ An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
Cites Work
- Multiple feedback at a single-server station
- Scheduling stochastic jobs on a single machine subject to breakdowns
- Sequencing with Series-Parallel Precedence Constraints
- On nonpreemptive strategies in stochastic scheduling
- On Scheduling Chains of Jobs on One Processor with Limited Preemption
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
This page was built for publication: A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair