期刊
MATHEMATICS AND COMPUTERS IN SIMULATION
卷 76, 期 5-6, 页码 447-462出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.matcom.2007.04.010
关键词
flexible job-shop scheduling; multi-objective optimization; genetic algorithms; Choquet integral; aggregation
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据