Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
From MaRDI portal
(Redirected from Publication:337585)
Recommendations
- Simultaneous scheduling of production and preventive maintenance on a single machine
- Machine scheduling performance with maintenance and failure
- A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach
- Joint job scheduling and preventive maintenance on a single machine
- Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment
Cites work
- A genetic algorithm for the flexible job-shop scheduling problem
- A genetic algorithm methodology for complex scheduling problems
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling.
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Approximability of two-machine no-wait flowshop scheduling with availability constraints.
- Bi-objective ant colony optimization approach to optimize production and maintenance scheduling
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- Considering scheduling and preventive maintenance in the flowshop sequencing problem
- Effective neighbourhood functions for the flexible job shop problem
- Flexible job shop scheduling with overlapping in operations
- Flexible job-shop scheduling problem under resource constraints
- Job-shop scheduling with multi-purpose machines
- Linguistic-based meta-heuristic optimization model for flexible job shop scheduling
- Machine scheduling with an availability constraint
- Makespan minimization for two parallel machines with an availability constraint
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
- New single machine and job-shop scheduling problems with availability constraints
- Routing and scheduling in a flexible job shop by tabu search
- Scheduling with limited machine availability
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- Single-machine scheduling with periodic maintenance to minimize makespan
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints
- Two-machine flow shops with limited machine availability
- Two-machine flowshop scheduling with availability constraints
Cited in
(7)- Job scheduling and management of wearing tools with stochastic tool lifetimes
- 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
- 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
- Proactive release procedures for just-in-time job shop environments, subject to machine failures
- A simulation optimization framework to solve stochastic flexible job-shop scheduling problems -- case: semiconductor manufacturing
This page was built for publication: Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337585)
