Risk measure of job shop scheduling with random machine breakdowns
From MaRDI portal
Publication:1654341
DOI10.1016/j.cor.2018.05.022zbMath1458.90374OpenAlexW2805694036MaRDI QIDQ1654341
Zigao Wu, Shichang Xiao, ShuDong Sun
Publication date: 8 August 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.05.022
Related Items
A survey of job shop scheduling problem: the types and models ⋮ Optimizing makespan and stability risks in job shop scheduling ⋮ Predictive-reactive strategy for identical parallel machine rescheduling ⋮ A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties ⋮ An improved hybrid metaheuristics and rule-based approach for flexible job-shop scheduling subject to machine breakdowns
Cites Work
- Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
- Integrated production scheduling and maintenance policy for robustness in a single machine
- A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms
- Minimizing makespan for scheduling stochastic job shop with random breakdown
- Minimizing total weighted completion time with an unexpected machine unavailable interval
- Scheduling deteriorating jobs on a single machine subject to breakdowns
- Single machine stochastic JIT scheduling problem subject to machine breakdowns
- Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
- A genetic algorithm for the job shop problem
- A survey of maintenance policies of deteriorating systems
- An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
- Deterministic job-shop scheduling: Past, present and future
- Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns
- A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
- Minimizing makespan on a single machine subject to random breakdowns
- Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures
- A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
- An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns
- A generic deadlock-free reactive scheduling approach
- Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment
- The Price of Robustness
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- Job Shop Scheduling by Simulated Annealing
- Single–machine scheduling with random machine breakdowns and randomly compressible processing times
- Rescheduling strategies for minimizing total weighted tardiness in complex job shops
- Scheduling
- Analysis of reactive scheduling problems in a job shop environment
