Choquet integral for criteria aggregation in the flexible job-shop scheduling problems

Ihsen Saad, Slim Hammadi, Mohamed Benrejeb and Pierre Borne

Mathematics and Computers in Simulation (MATCOM), 2008, vol. 76, issue 5, 447-462

Abstract: 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.

Keywords: Flexible job-shop scheduling; Multi-objective optimization; Genetic algorithms; Choquet integral; Aggregation (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475407001905
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:76:y:2008:i:5:p:447-462

DOI: 10.1016/j.matcom.2007.04.010

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().