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 条
  • [1] A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem
    Frutos, Mariano
    Carolina Olivera, Ana
    Tohme, Fernando
    [J]. ANNALS OF OPERATIONS RESEARCH, 2010, 181 (01) : 745 - 765
  • [2] A Memetic Algorithm for Solving Flexible Job-shop Scheduling Problems
    Ma, Wenping
    Zuo, Yi
    Zeng, Jiulin
    Liang, Shuang
    Jiao, Licheng
    [J]. 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 66 - 73
  • [3] Solving the Flexible Job Shop Scheduling Problem Based on Memetic Algorithm
    Zhang, Guohui
    [J]. ADVANCES IN PRODUCT DEVELOPMENT AND RELIABILITY III, 2012, 544 : 1 - 5
  • [4] A Genetic Algorithm for the Flexible Job-Shop Scheduling Problem
    Wang, Jin Feng
    Du, Bi Qiang
    Ding, Hai Min
    [J]. ADVANCED RESEARCH ON COMPUTER SCIENCE AND INFORMATION ENGINEERING, PT I, 2011, 152 : 332 - 339
  • [5] A genetic algorithm for the Flexible Job-shop Scheduling Problem
    Pezzella, F.
    Morganti, G.
    Ciaschetti, G.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (10) : 3202 - 3212
  • [6] A Hybrid Algorithm for Flexible Job-shop Scheduling Problem
    Tang, Jianchao
    Zhang, Guoji
    Lin, Binbin
    Zhang, Bixi
    [J]. CEIS 2011, 2011, 15
  • [7] Genetic algorithm for the flexible job-shop scheduling problem
    Kacem, I
    [J]. 2003 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2003, : 3464 - 3469
  • [8] Flexible Job-Shop Scheduling Problem by Genetic Algorithm
    Ida, Kenichi
    Oka, Kensaku
    [J]. ELECTRICAL ENGINEERING IN JAPAN, 2011, 177 (03) : 28 - 35
  • [9] A Multi-objective Memetic Algorithm for the Job-Shop Scheduling Problem
    Frutos, Mariano
    Tohme, Fernando
    [J]. OPERATIONAL RESEARCH, 2013, 13 (02) : 233 - 250
  • [10] An effective reformative memetic algorithm for distributed flexible job-shop scheduling problem with order cancellation
    Zhu, Nan
    Gong, Guiliang
    Lu, Dian
    Huang, Dan
    Peng, Ningtao
    Qi, Hao
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2024, 237
12345