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

Memetic algorithm based on learning and decomposition for multiobjective flexible job shop scheduling considering human factors

Lou, Hangyu; Wang, Xianpeng*; Dong, Zhiming; Yang, Yang*东北大学
Swarm and Evolutionary Computation2022-12DOI: 10.1016/j.swevo.2022.101204
17被引3阅读
引用收藏
分享

摘要

Human factors, including worker flexibility and learning-forgetting effects, are crucial factors in modern man-ufacturing systems to reduce costs and improve efficiency. However, traditional flexible job shop scheduling problem (FJSP) only considers machine flexibility and ignores human factors. Therefore, this paper originally investigates a multi-objective FJSP considering human factors (MO-FJSPHF) to simultaneously minimize makespan, maximum machine workload, and total machine workload. Firstly, a multi-objective mixed-integer nonlinear programming (MINLP) model is established based on the characteristics of the MO-FJSPHF. Then, a multi-objective memetic algorithm based on learning and decomposition (MOMA-LD) is proposed to solve the model by incorporating the learning-based adaptive local search into the multi-objective evolutionary algorithm based on decomposition (MOEA/D). In MOMA-LD, the machine learning technique determines which solutions deserve to perform the local search. Meanwhile, the computational resources are allocated dynamically based on the degree of population convergency during the evolutionary process. Experimental results show that our proposed algorithm outperforms four state-of-the-art algorithms on forty-three test instances and three real -world cases from a casting workshop. The validity of the proposed MINLP model is examined by the exact solver Gurobi.

学科与关键词

关键词
Evolutionary computationsFlexible job shop schedulingLearning-based local searchHuman factors
相关
加载中…
  • A memetic algorithm for multi-objective flexible job-shop problem with worker flexibility
    Gong, Xuran; Deng, Qianwang*; Gong, Guiliang; Liu, Wei; Ren, QinghuaInternational Journal of Production Research, 2018, 56(7): 2506-2522.被引 69
  • Memetic algorithm based on non-dominated levels for flexible job shop scheduling problem with learn-forgetting effect and worker cooperation
    Han, Kaixing; Gong, Wenyin*COMPUTERS & INDUSTRIAL ENGINEERING, 2025, 200: 110845.
  • Low carbon flexible job shop scheduling problem considering worker learning using a memetic algorithm
    Zhu, Huan; Deng, Qianwang*; Zhang, Like; Hu, Xiang; Lin, WenhuiOPTIMIZATION AND ENGINEERING, 2020, 21(4): 1691-1716.被引 31
查看全部 →

发表信息

论文状态
公开发表
期刊
Swarm and Evolutionary Computation
发表日期
2022-12
卷期
第 75 卷
页码
101204
DOI
10.1016/j.swevo.2022.101204
语言
ENGLISH
期刊等级
1区
成果收录
SCIE
资助标注
Major Program of National Natural Science Foundation of China [71790614]; Fund for the National Natural Science Foundation of China [62073067]; 111 Project [B16009]; Fundamental Research Funds for the Central Universities [N2128001]

作者

  • L

    Lou, Hangyu (第一作者)

    northeastern univ

  • W

    Wang, Xianpeng (通讯)

    northeastern univ

查看全部 4 位作者收起作者
  • D

    Dong, Zhiming

    northeastern univ

  • Y

    Yang, Yang (通讯)

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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