Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
From MaRDI portal
Publication:337585
DOI10.1016/j.cor.2015.02.014zbMath1348.90342OpenAlexW2029838689MaRDI QIDQ337585
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.02.014
Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic scheduling theory in operations research (90B36)
Related Items (4)
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 novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach ⋮ Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach
Cites Work
- Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- Single-machine scheduling with periodic maintenance to minimize makespan
- New single machine and job-shop scheduling problems with availability constraints
- Considering scheduling and preventive maintenance in the flowshop sequencing problem
- Flexible job shop scheduling with overlapping in operations
- Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
- Job-shop scheduling with multi-purpose machines
- Two-machine flowshop scheduling with availability constraints
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling.
- Approximability of two-machine no-wait flowshop scheduling with availability constraints.
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- Makespan minimization for two parallel machines with an availability constraint
- Scheduling with limited machine availability
- Effective neighbourhood functions for the flexible job shop problem
- Bi-objective ant colony optimization approach to optimize production and maintenance scheduling
- Routing and scheduling in a flexible job shop by tabu search
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A genetic algorithm for the flexible job-shop scheduling problem
- Machine scheduling with an availability constraint
- A genetic algorithm methodology for complex scheduling problems
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- Linguistic-based meta-heuristic optimization model for flexible job shop scheduling
- Flexible job-shop scheduling problem under resource constraints
- Two-machine flow shops with limited machine availability
This page was built for publication: Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
