A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown

Authors:
Ehram Safari;Seyed Jafar Sadjadi
Affiliations:
Department of Industrial Engineering, Iran University of Science and Technology, Iran;Department of Industrial Engineering, Iran University of Science and Technology, Iran
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 16
Cited 0

The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem

Computers and Operations Research
Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problems

Fuzzy Sets and Systems - Special issue on operations research
A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Genetic algorithms for flowshop scheduling problems

Computers and Industrial Engineering
Multiobjective Scheduling by Genetic Algorithms

Multiobjective Scheduling by Genetic Algorithms
Genetic Local Search Algorithms for the Travelling Salesman Problem

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Single-machine scheduling with periodic maintenance and nonresumable jobs

Computers and Operations Research
Improved genetic algorithm for the permutation flowshop scheduling problem

Computers and Operations Research
A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families

Computers and Operations Research
Considering scheduling and preventive maintenance in the flowshop sequencing problem

Computers and Operations Research
A two-machine flowshop scheduling problem with a separated maintenance constraint

Computers and Operations Research
Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separated

Robotics and Computer-Integrated Manufacturing
An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness

Expert Systems with Applications: An International Journal
Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints

Computers and Industrial Engineering
Solving Part-Type Selection and Operation Allocation Problems in an FMS: An Approach Using Constraints-Based Fast Simulated Annealing Algorithm

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

Operations Research Letters

Quantified Score

Hi-index	12.05

Visualization

Abstract

One of the most important assumptions in production scheduling is that the machines are permanently available without any breakdown. In the real world of scheduling, machines can be made unavailable due to various reasons such as preventive maintenance and unpredicted breakdown. In this paper, we explore flowshop configuration under the assumption of condition-based maintenance to minimize expected makespan. Furthermore, we consider a condition-based maintenance (CBM) strategy which could be used in most industrial settings. The proposed algorithm is designed for non-resumable flowshop state where the processing of jobs after preventive maintenance is restarted from the beginning. We propose a hybrid algorithm based on genetic algorithm and simulated annealing. Additionally, we conduct an extensive parameter calibration with the utilization of Taguchi method and select the optimal levels of the algorithm's performance influential factors. The preliminary results indicate that the proposed method provides significantly better results compared with other high performing algorithms in the literature.