期刊
ANNALS OF OPERATIONS RESEARCH
卷 181, 期 1, 页码 745-765出版社
SPRINGER
DOI: 10.1007/s10479-010-0751-9
关键词
Flexible job-shop scheduling problem; Memetic algorithms; NSGAII; Multi-objective optimization
资金
- Consejo Nacional de Investigaciones Cientificas y Tecnicas
- Universidad Nacional del Sur [PGI 24/JO39]
The Flexible Job-Shop Scheduling Problem is concerned with the determination of a sequence of jobs, consisting of many operations, on different machines, satisfying several parallel goals. We introduce a Memetic Algorithm, based on the NSGAII (Non-Dominated Sorting Genetic Algorithm II) acting on two chromosomes, to solve this problem. The algorithm adds, to the genetic stage, a local search procedure (Simulated Annealing). We have assessed its efficiency by running the algorithm on multiple objective instances of the problem. We draw statistics from those runs, which indicate that this Memetic Algorithm yields good and low-cost solutions.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据