A genetic algorithm for a Bicriteria flexible job shop scheduling problem

被引:8
|
作者
Vilcot, Geoffrey [1 ,2 ]
Billaut, Jean-Charles [2 ]
Esswein, Carl [2 ]
机构
[1] Volume Software, F-37026 Tours 1, France
[2] Univ Francois Rabelais Tours, Lab d'Informat, Tours, France
关键词
scheduling; flexible job shop; genetic algorithm; Bicriteria;
D O I
10.1109/ICSSSM.2006.320686
中图分类号
F [经济];
学科分类号
02 ;
摘要
The problem we consider in this paper is a flexible job shop scheduling problem. The aim is to minimize two criteria: the makespan and the maximum lateness and we are interested in finding an approximation of the Pareto front. The method that we propose is a Genetic algorithm. The initial population is partially generated by using a Tabu Search algorithm which minimizes a linear combination of the two criteria. The method is tested on benchmark instances from literature.
引用
收藏
页码:1240 / 1244
页数:5
相关论文
共 50 条
  • [31] Genetic algorithm for flexible job-shop scheduling
    Univ of Magdeburg, Magdeburg, Germany
    Proc IEEE Int Conf Rob Autom, (1120-1125):
  • [32] 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
  • [33] A Parallel Genetic Algorithm for the Job Shop Scheduling Problem
    Nguyen Huu Mui
    Vu Dinh Hoa
    Luc Tri Tuyen
    2012 IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY (ISSPIT), 2012, : 19 - 24
  • [34] A hybrid genetic algorithm for the job shop scheduling problem
    Gonçalves, JF
    Mendes, JJDM
    Resende, MGC
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 167 (01) : 77 - 95
  • [35] Genetic algorithm application on the job shop scheduling problem
    Wu, CG
    Xing, XL
    Lee, HP
    Zhou, CG
    Liang, YC
    PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 2102 - 2106
  • [36] An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints
    Zhang, Guohui
    Hu, Yifan
    Sun, Jinghe
    Zhang, Wenqiang
    SWARM AND EVOLUTIONARY COMPUTATION, 2020, 54
  • [37] An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints
    Zhang G.
    Hu Y.
    Sun J.
    Zhang W.
    Swarm and Evolutionary Computation, 2020, 54
  • [38] An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem
    Li, Xinyu
    Gao, Liang
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2016, 174 : 93 - 110
  • [39] Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem
    Gutierrez, Celia
    Garcia-Magarino, Ivan
    KNOWLEDGE-BASED SYSTEMS, 2011, 24 (01) : 102 - 112
  • [40] 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