An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem
作者: Eduardo Camargo de SiqueiraMarcone Jamilson Freitas SouzaSérgio Ricardo de Souza
作者单位: 1Federal Institute of Education Science and Technology of Triângulo Mineiro (IFTM) Paracatu MG 38600‐000 Brazil
2 Federal University of Ouro Preto (UFOP) Ouro Preto MG 35400‐000 Brazil
3 Federal Center of Technological Education of Minas Gerais (CEFET‐MG) Av. Amazonas, 7675 – Nova Gameleira Belo Horizonte MG 30510‐000 Brazil
刊名: International Transactions in Operational Research, 2020, Vol.27 (1), pp.614-650
来源数据库: Wiley Journal
DOI: 10.1111/itor.12662
关键词: Multiobjective hybrid flow shopMO‐GVNSHFSMultiobjective optimizationVNS
原始语种摘要: Abstract(#br)This paper addresses the multiobjective hybrid flow shop (MOHFS) scheduling problem. In the MOHFS problem considered here, we have a set of jobs that must be performed in a set of stages. At each stage, we have a set of unrelated parallel machines. Some jobs may skip stages. The evaluation criteria are the minimizations of makespan, the weighted sum of the tardiness, and the weighted sum of the earliness. For solving it, an algorithm based on the multiobjective general variable neighborhood search (MO‐GVNS) metaheuristic, named adapted MO‐GVNS, is proposed. This work also presents and compares the results obtained by the adapted MO‐GVNS with those of four other algorithms: multiobjective reduced variable neighborhood search, nondominated sorting genetic algorithm II...
全文获取路径: Wiley  (合作)

  • multiobjective 多目标
  • problem 题目
  • solving 求解
  • algorithm 算法
  • scheduling 
  • variable 变量
  • neighborhood 邻域
  • tardiness 缓慢
  • proposed 建议的
  • hybrid 杂种