Minimizing makespan for scheduling stochastic job shop with random breakdown
From MaRDI portal
Publication:388592
DOI10.1016/j.amc.2012.04.091zbMath1278.90181OpenAlexW2040400124MaRDI QIDQ388592
Publication date: 2 January 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.04.091
genetic algorithmbreakdown\(\text{Resumable}\) jobdiscrete event drivenstochastic job shop scheduling
Related Items
Biogeography-based optimization for optimal job scheduling in cloud computing ⋮ Risk measure of job shop scheduling with random machine breakdowns ⋮ Optimizing makespan and stability risks in job shop scheduling ⋮ A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Single-machine scheduling to stochastically minimize maximum lateness
- A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
- A novel parallel quantum genetic algorithm for stochastic job shop scheduling
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
- Two-machine ordered flowshop scheduling under random breakdowns
- An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
- Minimizing the expected number of tardy jobs when processing times are normally distributed
- A generalized permutation approach to job shop scheduling with genetic algorithms
- Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities
- A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
- A hybrid method for solving stochastic job shop scheduling problems
- Minimizing makespan on a single machine subject to random breakdowns
- A genetic algorithm for flexible job shop scheduling with fuzzy processing time
- Forecasting policies for scheduling a stochastic due date job shop
- Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns
This page was built for publication: Minimizing makespan for scheduling stochastic job shop with random breakdown