Genetic algorithms for flowshop scheduling problems
Computers and Industrial Engineering
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Managing Genetic Search in Job Shop Scheduling
IEEE Expert: Intelligent Systems and Their Applications
An Investigation of Niche and Species Formation in Genetic Function Optimization
Proceedings of the 3rd International Conference on Genetic Algorithms
Muiltiobjective optimization using nondominated sorting in genetic algorithms
Evolutionary Computation
Expert Systems with Applications: An International Journal
Computers and Industrial Engineering
| Hi-index | 0.00 |
This paper adapts metaheuristic methods to develop Pareto optimal solutions to multi-criteria production scheduling problems. Approach is inspired by enhanced versions of genetic algorithms. Method first extends the Nondominated Sorting Genetic Algorithm (NSGA), a method recently proposed to produce Pareto-optimal solutions to numerical multi-objective problems. Multi-criteria flowshop scheduling is addressed next. Multi-criteria job shop scheduling is subsequently examined. Lastly the multi-criteria open shop problem is solved. Final solutions to each are Pareto optimal. The paper concludes with a statistical comparison of the performance of the basic NSGA to NSGA augmented by elitist selection.