A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem

被引：0
|
作者：
Mariano Frutos
Ana Carolina Olivera
Fernando Tohmé
机构：
[1] CONICET,Department of Engineering
[2] Universidad Nacional del Sur,Department of Computer Science & Engineering
[3] CONICET,Department of Economics
[4] Universidad Nacional del Sur,undefined
[5] CONICET,undefined
[6] Universidad Nacional del Sur,undefined
来源：
Annals of Operations Research | 2010年 / 181卷
关键词：
Flexible job-shop scheduling problem; Memetic algorithms; NSGAII; Multi-objective optimization;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：745 / 765
页数：20
相关论文
共 50 条
  • [31] A Memetic Algorithm based on Immune Multi-objective Optimization for Flexible Job-shop Scheduling Problems
    Ma, Jingjing
    Lei, Yu
    Wang, Zhao
    Jiao, Licheng
    Liu, Ruochen
    2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 58 - 65
  • [32] Application of multi-objective memetic algorithm in multi-objective flexible job-shop scheduling problem
    Zhenwen, H.U.
    Academic Journal of Manufacturing Engineering, 2019, 17 (03): : 24 - 28
  • [33] A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
    Amiri, M.
    Zandieh, M.
    Yazdani, M.
    Bagheri, A.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (19) : 5671 - 5689
  • [34] Operator allocation model and scheduling algorithm for flexible job-shop problem
    Gao, Li
    Xu, Ke-Lin
    Zhu, Wei
    Tong, Ke-Na
    Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology, 2012, 44 (05): : 144 - 148
  • [35] A Modified Adaptive Genetic Algorithm for the Flexible Job-shop Scheduling Problem
    Pan, Ying
    Xue, Dongjuan
    Gao, Tianyi
    Zhou, Libin
    Xie, Xiaoyu
    FRONTIERS OF MANUFACTURING SCIENCE AND MEASURING TECHNOLOGY III, PTS 1-3, 2013, 401 : 2037 - +
  • [36] An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem
    De Giovanni, L.
    Pezzella, F.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 200 (02) : 395 - 408
  • [37] An Improved Social Spider Algorithm for the Flexible Job-Shop Scheduling Problem
    Wang, Yao
    Zhu, Linbo
    Wang, Jiwen
    Qiu, Jianfeng
    PROCEEDINGS OF 2015 INTERNATIONAL CONFERENCE ON ESTIMATION, DETECTION AND INFORMATION FUSION ICEDIF 2015, 2015, : 157 - 162
  • [38] A Memetic Algorithm for the Multi-Objective Flexible Job Shop Scheduling Problem
    Yuan, Yuan
    Xu, Hua
    GECCO'13: PROCEEDINGS OF THE 2013 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2013, : 559 - 566
  • [39] An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers
    Luo, Qiang
    Deng, Qianwang
    Gong, Guiliang
    Zhang, Like
    Han, Wenwu
    Li, Kexin
    EXPERT SYSTEMS WITH APPLICATIONS, 2020, 160
  • [40] An improved memetic algorithm for the flexible job shop scheduling problem with transportation times
    Zhang, Guohui
    Sun, Jinghe
    Lu, Xixi
    Zhang, Haijun
    MEASUREMENT & CONTROL, 2020, 53 (7-8): : 1518 - 1528
12345