Minimizing makespan for scheduling stochastic job shop with random breakdown

DOI10.1016/J.AMC.2012.04.091zbMATH Open1278.90181OpenAlexW2040400124MaRDI QIDQ388592FDOQ388592

Authors: Deming Lei 

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

Recommendations

• Robust and stable flexible job shop scheduling with random machine breakdowns: multi-objectives genetic algorithm approach
• A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
• A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems
• Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
• A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling

zbMATH Keywords

genetic algorithm\(\text{Resumable}\) jobbreakdowndiscrete event drivenstochastic job shop scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Cites Work

• Optimization by simulated annealing
• Title not available (Why is that?)
• A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
• A genetic algorithm for flexible job shop scheduling with fuzzy processing time
• A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
• A generalized permutation approach to job shop scheduling with genetic algorithms
• Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
• A novel parallel quantum genetic algorithm for stochastic job shop scheduling
• Minimizing the expected number of tardy jobs when processing times are normally distributed
• Two-machine ordered flowshop scheduling under random breakdowns
• An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
• 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
• A hybrid method for solving stochastic job shop scheduling problems
• Minimizing makespan on a single machine subject to random breakdowns
• Forecasting policies for scheduling a stochastic due date job shop
• Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns
• Single-machine scheduling to stochastically minimize maximum lateness

Cited In (10)

• Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns
• Risk measure of job shop scheduling with random machine breakdowns
• Biogeography-based optimization for optimal job scheduling in cloud computing
• An improved hybrid metaheuristics and rule-based approach for flexible job-shop scheduling subject to 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
• Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem
• A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems
• Learning single-machine robust scheduling heuristic subject to stochastic breakdowns using genetic programming
• A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling

This page was built for publication: Minimizing makespan for scheduling stochastic job shop with random breakdown

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