A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem
A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem
复制标题
DOI：
10.1007/s10479-010-0751-9
复制
发表时间：
2010-05
影响因子：
4.8
通讯作者：
Mariano Frutos;A. Olivera;F. Tohmé
中科院分区：
文献类型：
--
作者：
Mariano Frutos;A. Olivera;F. Tohmé
柔性作业车间调度问题是指在不同的机器上确定由多道工序组成的满足多个并行目标的作业序列。提出了一种基于非支配排序遗传算法II(NSGAII)作用于两条染色体的Memtic算法来解决这一问题。该算法在遗传阶段增加了局部搜索过程(模拟退火法)。我们通过在问题的多个目标实例上运行该算法来评估其效率。我们从这些运行中得出了统计数据，这表明这种Memtic算法产生了良好的和低成本的解决方案。
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.