A Memetic Algorithm for Due-Date Satisfaction in Fuzzy Job Shop Scheduling

被引：2
|
作者：
Jose Palacios, Juan [1 ]
Vela, Camino R. [1 ]
Gonzalez-Rodriguez, Ines [2 ]
Puente, Jorge [1 ]
机构：
[1] Univ Oviedo, Dept Comp Sci, Oviedo, Spain
[2] Univ Cantabria, Dept Math Stat & Comp, Santander, Spain
来源：
NATURAL AND ARTIFICIAL COMPUTATION FOR BIOMEDICINE AND NEUROSCIENCE, PT I | 2017年 / 10337卷
关键词：
GENETIC ALGORITHMS; PROCESSING TIME; DUEDATE;
D O I：
10.1007/978-3-319-59740-9_14
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider the job shop scheduling problem with fuzzy sets modelling uncertain durations and flexible due dates. With the goal of maximising due-date satisfaction, we propose a memetic algorithm that combines intensification and diversification by integrating local search in a genetic algorithm. Experimental results illustrate the synergy between both components of the algorithm as well as its potential to provide good solutions.
引用
收藏
页码：135 / 145
页数：11
相关论文
共 50 条
12345