Bi-objective optimization research on integrated fixed time interval preventive maintenance and production for scheduling flexible job-shop problem

Authors:
E. Moradi;S. M. T. Fatemi Ghomi;M. Zandieh
Affiliations:
Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311 Tehran, Iran;Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311 Tehran, Iran;Department of Industrial Management, Accounting and Management Faculty, Shahid Beheshti University, G.C., Tehran, Iran
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 11
Cited 4

Routing and scheduling in a flexible job shop by tabu search

Annals of Operations Research - Special issue on Tabu search
A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation

Computers and Industrial Engineering
Integrating maintenance and production decisions in a hierarchical production planning environment

Computers and Operations Research - Special issue on aggregation and disaggregation in operations research
Explicit building-block multiobjective genetic algorithms: theory, analysis, and development

Explicit building-block multiobjective genetic algorithms: theory, analysis, and development
Genetic algorithms for integrated preventive maintenance planning and production scheduling for a single machine

Computers in Industry - Special issue: Application of genetics algorithms in industry
Considering scheduling and preventive maintenance in the flowshop sequencing problem

Computers and Operations Research
A genetic algorithm for the Flexible Job-shop Scheduling Problem

Computers and Operations Research
Maintenance scheduling and production control of multiple-machine manufacturing systems

Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
The measure of Pareto optima applications to multi-objective metaheuristics

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
A real-world test problem for EMO algorithms

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling

IEEE Transactions on Evolutionary Computation

Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm

Expert Systems with Applications: An International Journal
Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling

Applied Soft Computing
A 3D visualized expert system for maintenance and management of existing building facilities using reliability-based method

Expert Systems with Applications: An International Journal
A chaotic non-dominated sorting genetic algorithm for the multi-objective automatic test task scheduling problem

Applied Soft Computing

Quantified Score

Hi-index	12.06

Visualization

Abstract

This paper investigates integrated flexible job shop problem (FJSP) with preventive maintenance (PM) activities under the multi-objective optimization approaches. Finding compromise solutions between the production objectives and maintenance ones is under consideration. In order to carry out the maintenance activities, reliability models are employed. This paper attempts to simultaneously optimize two objectives: the minimization of the makespan for the production part and the minimization of the system unavailability for the maintenance part. For doing it so, two decisions are taken at the same time: finding the appropriate assignment of n jobs on m machines in order to minimize the makespan and deciding when to execute the PM activities in order to minimize the system unavailability. Both the maintenance activity numbers and maintenance intervals are not fixed in advance. Four multi-objective optimization methods are compared to find the Pareto-optimal front in the flexible job-shop problem case. Promising the obtained results, a benchmark with a large number of test instances (more than 4800) and meticulous care is employed.