Sequencing with earliness and tardiness penalties: a review
Operations Research
A genetic algorithm for flowshop sequencing
Computers and Operations Research - Special issue on genetic algorithms
A simulated annealing heuristic for scheduling in a flowshop with bicriteria
ICC&IE-94 Selected papers from the 16th annual conference on Computers and industrial engineering
Multi-objective genetic algorithm and its applications to flowshop scheduling
Computers and Industrial Engineering
A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation
Computers and Industrial Engineering
Computers and Operations Research
Multiobjective Scheduling by Genetic Algorithms
Multiobjective Scheduling by Genetic Algorithms
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
INFORMS Journal on Computing
An ant colony system for permutation flow-shop sequencing
Computers and Operations Research
Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art
Evolutionary Computation
Choquet integral for criteria aggregation in the flexible job-shop scheduling problems
Mathematics and Computers in Simulation
Ant colony optimization for multi-objective flow shop scheduling problem
Computers and Industrial Engineering
International Journal of Computer Integrated Manufacturing - Global Competitive Manufacturing
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
Computers and Operations Research
Aggregation Functions: A Guide for Practitioners
Aggregation Functions: A Guide for Practitioners
A multi-objective ant colony system algorithm for flow shop scheduling problem
Expert Systems with Applications: An International Journal
Metaheuristics: From Design to Implementation
Metaheuristics: From Design to Implementation
Advances in Engineering Software
A multi-objective genetic local search algorithm and itsapplication to flowshop scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Most of the research in multi-objective scheduling optimization uses the classical weighted arithmetic mean operator to aggregate the various optimization criteria. However, there are scheduling problems where criteria are considered interact and thus a different operator should be adopted. This paper is devoted to the search of Pareto-optimal solutions in a tri-criterion flow-shop scheduling problem (FSSP) considering the interactions among the objectives. A new hybrid meta-heuristic is proposed to solve the problem which combines a genetic algorithm (GA) for solutions evolution and a reduced variable neighborhood search (RVNS) technique for fast solution improvement. To deal with the interactions among the three criteria the discrete Choquet integral method is adopted as a means to aggregate the criteria in the fitness function of each individual solution. Experimental comparisons (over public available FSSP test instances) with five existing multi-objective evolutionary algorithms (including the well known SPEA2 and NSGAII algorithms as well as the recently published L-NSGA algorithm) showed a superior performance for the developed approach in terms of diversity and domination of solutions.