Minimizing makespan for scheduling stochastic job shop with random breakdown

DOI10.1016/J.AMC.2012.04.091MaRDI QIDQ388592zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

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

Cites work

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

Cited in

(11)

• Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns
• A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties
• A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems
• Robust and stable flexible job shop scheduling with random machine breakdowns: multi-objectives genetic algorithm approach
• Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem
• A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling
• Risk measure of job shop scheduling with random machine breakdowns
• Biogeography-based optimization for optimal job scheduling in cloud computing
• Optimizing makespan and stability risks in job shop scheduling
• An improved hybrid metaheuristics and rule-based approach for flexible job-shop scheduling subject to machine breakdowns
• Learning single-machine robust scheduling heuristic subject to stochastic breakdowns using genetic programming

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)