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
来源
关键词
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 条
  • [21] An effective genetic algorithm for the flexible job-shop scheduling problem
    Zhang, Guohui
    Gao, Liang
    Shi, Yang
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (04) : 3563 - 3573
  • [22] An Efficient Genetic Algorithm for Flexible Job-Shop Scheduling Problem
    Moghadam, Ali Mokhtari
    Wong, Kuan Yew
    Piroozfard, Hamed
    2014 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2014, : 1409 - 1413
  • [23] Improved genetic algorithm for the flexible job-shop scheduling problem
    Zhang, Guohui
    Gao, Liang
    Li, Peigen
    Zhang, Chaoyong
    Jixie Gongcheng Xuebao/Journal of Mechanical Engineering, 2009, 45 (07): : 145 - 151
  • [24] A Hybrid Genetic Algorithm for Flexible Job-shop Scheduling Problem
    Wang Shuang-xi
    Zhang Chao-yong
    Jin Liang-liang
    ENGINEERING SOLUTIONS FOR MANUFACTURING PROCESSES IV, PTS 1 AND 2, 2014, 889-890 : 1179 - 1184
  • [25] Research on flexible job-shop scheduling problem based on a modified genetic algorithm
    Wei Sun
    Ying Pan
    Xiaohong Lu
    Qinyi Ma
    Journal of Mechanical Science and Technology, 2010, 24 : 2119 - 2125
  • [26] Research on flexible job-shop scheduling problem based on a modified genetic algorithm
    Sun, Wei
    Pan, Ying
    Lu, Xiaohong
    Ma, Qinyi
    JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY, 2010, 24 (10) : 2119 - 2125
  • [27] Flexible Job-shop Scheduling Problem Under Uncertainty Based On QPSO Algorithm
    Pan, Fengshan
    Ye, Chunming
    Yang, Jiao
    ADVANCED DESIGNS AND RESEARCHES FOR MANUFACTURING, PTS 1-3, 2013, 605-607 : 487 - +
  • [28] A Novel Memetic Algorithm Based on Decomposition for Multiobjective Flexible Job Shop Scheduling Problem
    Wang, Chun
    Ji, Zhicheng
    Wang, Yan
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2017, 2017
  • [29] A genetic algorithm for flexible job-shop scheduling
    Chen, HX
    Ihlow, J
    Lehmann, C
    ICRA '99: IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-4, PROCEEDINGS, 1999, : 1120 - 1125
  • [30] Genetic algorithm for flexible job-shop scheduling
    Univ of Magdeburg, Magdeburg, Germany
    Proc IEEE Int Conf Rob Autom, (1120-1125):