A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach
Publication:1730479
DOI10.1007/S10479-017-2594-0zbMath1434.90068OpenAlexW2753381720MaRDI QIDQ1730479
Seyed Habib A. Rahmati, Kannan Govindan, Abbas Ahmadi
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2594-0
simulation-based optimizationcondition-based maintenance (CBM)degradation visualizationflexible job shop scheduling problem (FJSP)harmony search optimization (HSO)
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
- A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms
- Evaluation of mathematical models for flexible job-shop scheduling problems
- Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints
- An effective architecture for learning and evolving flexible job-shop schedules
- 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
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
- Job-shop scheduling with multi-purpose machines
- Imperfect maintenance
- Two-machine flowshop scheduling with availability constraints
- A review of multi-component maintenance models with economic dependence
- Approximability of two-machine no-wait flowshop scheduling with availability constraints.
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- A survey of maintenance policies of deteriorating systems
- Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- Makespan minimization for two parallel machines with an availability constraint
- Scheduling with limited machine availability
- A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
- Parallel machine scheduling with machine availability and eligibility constraints
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Scheduling two-stage hybrid flow shop with availability constraints
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- Scheduling jobs and maintenance activities on parallel machines
- Two-machine flow shops with limited machine availability
This page was built for publication: A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach