Journal
MATHEMATICS AND COMPUTERS IN SIMULATION
Volume 76, Issue 5-6, Pages 447-462Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.matcom.2007.04.010
Keywords
flexible job-shop scheduling; multi-objective optimization; genetic algorithms; Choquet integral; aggregation
Ask authors/readers for more resources
Most complex scheduling problems are combinatorial problems and difficult to solve. That is why, several methods focus on the optimization according to a single criterion such as makespan, workloads of machines, waiting times, etc. In this paper, the Choquet integral is introduced as a general tool for dealing with multiple criteria decision making and used in optimization flexible job-shop scheduling problems. The considered optimization problem is based of the Genetic Algorithm (GA) used as objective function the Choquet integral for criteria aggregation. Then lower bounds are defined for each criterion. Presented examples illustrate theoretical considerations and show the efficiency of the proposed approach. (c) 2007 IMACS. Published by Elsevier B.V. All rights reserved.
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