Considering scheduling and preventive maintenance in the flowshop sequencing problem
From MaRDI portal
Publication:883296
DOI10.1016/j.cor.2005.12.007zbMath1128.90031MaRDI QIDQ883296
Rubén Ruiz, J. Carlos García-Díaz, Concepción Maroto
Publication date: 4 June 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.12.007
90B35: Deterministic scheduling theory in operations research
90B25: Reliability, availability, maintenance, inspection in operations research
Related Items
Minimizing total completion time on a single machine with a flexible maintenance activity, Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new heuristic method for the flow shop sequencing problem
- A fast tabu search algorithm for the permutation flow-shop problem
- A contribution to the stochastic flow shop scheduling problem.
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- A comprehensive review and evaluation of permutation flowshop heuristics
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Optimal two- and three-stage production schedules with setup times included
- Optimum Preventive Maintenance Policies
- A repair replacement model
- Optimal strategies for some repair replacement models
- A survey of maintenance models: The control and surveillance of deteriorating systems
- On general routing problems
- An Evaluation of Flow Shop Sequencing Heuristics
- Production and maintenance integrated planning
- Maintenance Policies for Stochastically Failing Equipment: A Survey
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Single-machine scheduling with maintenance and repair rate-modifying activities
