Journal
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
Volume 64, Issue 5-8, Pages 915-932Publisher
SPRINGER LONDON LTD
DOI: 10.1007/s00170-012-4051-1
Keywords
Scheduling; Flexible job shop; Multiobjective evolutionary algorithm; Non-dominated sorting genetic algorithm; Non-dominated ranking genetic algorithm
Ask authors/readers for more resources
The aim of this paper is to study multi-objective flexible job shop scheduling problem (MOFJSP). Flexible job shop scheduling problem is a modified version of job shop scheduling problem (JSP) in which an operation is allowed to be processed by any machine from a given set of capable machines. The objectives that are considered in this study are makespan, critical machine work load, and total work load of machines. In the literature of the MOFJSP, since this problem is known as an NP-hard problem, most of the studies have developed metaheuristic algorithms to solve it. Most of them have integrated their objective functions and used an integrated single-objective metaheuristic algorithm though. In this study, two new version of multi-objective evolutionary algorithms including non-dominated sorting genetic algorithm and non-dominated ranking genetic algorithm are adapted for MOFJSP. These algorithms use new multi-objective Pareto-based modules instead of multi-criteria concepts to guide their process. Another contribution of this paper is introducing of famous metrics of the multi-objective evaluation to literature of the MOFJSP. A new measure is also proposed. Finally, through using numerous test problems, calculating a number of measures, performing different statistical tests, and plotting different types of figures, it is shown that proposed algorithms are at least as good as literature's algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available