ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers

Luo, Qiang; Deng, Qianwang*; Gong, Guiliang; Zhang, Like; Han, Wenwu; Li, Kexinhunan univ
EXPERT SYSTEMS WITH APPLICATIONS2020-12-1DOI: 10.1016/j.eswa.2020.113721
97被引3阅读
引用收藏
分享

摘要

The traditional distributed flexible job shop scheduling problem (DFJSP) assumes that operations of a job cannot be transferred between different factories. However, in real-world production settings, the operations of a job may need to be processed in different factories owing to requirements of economic globalization or complexity of the job. Hence, in this paper, we propose a distributed flexible job shop scheduling problem with transfers (DFJSPT), in which operations of a job can be processed in different factories. An efficient memetic algorithm (EMA) is proposed to solve the DFJSPT with the objectives of minimizing the makespan, maximum workload, and total energy consumption of factories. In the proposed EMA, a well-designed chromosome presentation and initialization methods are presented to obtain a high-quality initial population. Several crossover and mutation operators and three effective neighborhood structures are designed to expand the search space and accelerate the convergence speed of the solution. Forty benchmark instances of the DFJSPT are constructed to evaluate the EMA and facilitate further studies. The Taguchi method of design of experiments is used to obtain the best combination of key EMA parameters. Extensive computational experiments are carried out to compare the EMA with three well-known algorithms from the literature. The computational results show that the EMA can obtain better solutions for approximately 90% of the tested benchmark instances compared to the three wellknown algorithms, thereby demonstrating the DFJSPT's competitive performance and efficiency.

学科与关键词

关键词
Distributed flexible job shop schedulingOperation transferMemetic algorithmMulti-objective optimizationTaguchi method
相关
加载中…
  • Hybrid Memetic Algorithm to Solve Multiobjective Distributed Fuzzy Flexible Job Shop Scheduling Problem with Transfer
    Yang, Jinfeng; Xu, Hua*Processes, 2022, 10(8): 1517.被引 9
  • An effective memetic algorithm for distributed flexible job shop scheduling problem considering integrated sequencing flexibility
    Tang, Jiuqiang; Gong, Guiliang*; Peng, Ningtao; Zhu, Kaikai; Huang, Dan; Luo, QiangEXPERT SYSTEMS WITH APPLICATIONS, 2024, 242: 122734.被引 12
  • A memetic algorithm for multi-objective distributed production scheduling: minimizing the makespan and total energy consumption
    Gong, Guiliang; Chiong, Raymond; Deng, Qianwang*; Luo, QiangJOURNAL OF INTELLIGENT MANUFACTURING, 2020, 31(6): 1443-1466.被引 40
查看全部 →

发表信息

论文状态
公开发表
期刊
EXPERT SYSTEMS WITH APPLICATIONS
发表日期
2020-12-01
卷期
第 160 卷
页码
113721
DOI
10.1016/j.eswa.2020.113721
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
1区
成果收录
SCIE
资助标注
National Key R&D Program of China [2018YFB1701400]; National Natural Science Foundation of China [71473077]; State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body [71775004]; State Key Laboratory of Construction Machinery [SKLCM2019-03]

作者

  • L

    Luo, Qiang (第一作者)

    hunan univ

  • D

    Deng, Qianwang (通讯)

    hunan univ

查看全部 6 位作者收起作者
  • G

    Gong, Guiliang

    hunan univ

  • Z

    Zhang, Like

    hunan univ

  • H

    Han, Wenwu

    hunan univ

  • L

    Li, Kexin

    hunan univ

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417