This paper provides a short summary of a novel algorithm tailored towards multi-objective flexible job shop scheduling problems (FJSP). The result shows that for challenging real-world problems in combinatorial optimization, off-the-shelf implementations of multi-objective optimization evolutionary algorithms (MOEAs) might not work, but by using various adaptations, these methods can be tailored to provide excellent results. This is demonstrated for a state of the art MOEA, that is NSGA-III, and the following adaptations: (1) initialization approaches to enrich the first-generation population, (2) various crossover operators to create a better diversity of offspring, (3) parameter tuning, to determine the optimal mutation probabilities, using the MIP-EGO configurator, (4) local search strategies to explore the neighborhood for better solutions. Using these measures, NSGA-III has been enabled to solve benchmark multi-objective FJSPs and experimental results show excellent performance.
[1]
Tsung-Che Chiang,et al.
A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling
,
2013
.
[2]
Hua Xu,et al.
Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms
,
2015,
IEEE Transactions on Automation Science and Engineering.
[3]
Hao Wang,et al.
Automatic Configuration of Deep Neural Networks with EGO
,
2018,
ArXiv.
[4]
Yali Wang,et al.
A Tailored NSGA-III Instantiation for Flexible Job Shop Scheduling
,
2020,
ArXiv.
[5]
X. Shao,et al.
A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem
,
2010
.