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

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 ENGINEERING2025-2DOI: 10.1016/j.cie.2024.110845
2阅读
引用收藏
分享

摘要

Traditional flexible job shop scheduling problems (FJSP) often focus on the flexibility of machines, neglecting the effectiveness and flexibility of workers. In real production environments, workers' processing proficiency is influenced by the learn-forgetting effect, and they tend to cooperate when handling complex tasks to reduce difficulties. The impact and interests of workers are increasingly becoming indispensable factors in modern manufacturing systems. Therefore, this paper investigates a FJSP with learn-forgetting effect and worker cooperation (FJSP-LFWC) to simultaneously optimize makespan and maximum worker workload. A mathematical model is established for this problem, and a memetic algorithm based on non-dominated levels (MANL) is proposed to efficiently solve it. MANL addresses the problem in several key ways. Firstly, it generates a high-quality initial population through a meticulously designed hybrid initialization strategy. Secondly, it applies a novel decoding method to improve solution quality. Thirdly, it adjusts the selection strategy based on the convergence of the population. Additionally, a tailored local search strategy incorporating five local search operators is utilized for three types of candidate solutions to accelerate convergence and fully utilize the solution space. Extensive experiments are conducted based on 28 newly formulated instances. The experimental results demonstrate that MANL significantly outperforms five well-known comparison algorithms, showcasing its efficiency in solving FJSP-LFWC.

学科与关键词

关键词
Flexible job shop schedulingNon-dominated sortingMemetic algorithmProficiency levelCooperation flexibility
相关
加载中…
  • 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 Computation, 2022, 75: 101204.被引 17
  • 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
  • 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
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPUTERS & INDUSTRIAL ENGINEERING
发表日期
2025-02
卷期
第 200 卷
页码
110845
DOI
10.1016/j.cie.2024.110845
语言
MULTI-LANGUAGE
成果收录
SCIE
资助标注
Open Research Fund of the State Key Lab of Digital Manufacturing Equipment and Technology, China [IMETKF2024020]

作者

  • H

    Han, Kaixing (第一作者)

  • G

    Gong, Wenyin (通讯)

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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