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

A Pareto-based two-stage evolutionary algorithm for flexible job shop scheduling problem with worker cooperation flexibility

Luo, Qiang; Deng, Qianwang*; Xie, Guanhua; Gong, Guilianghunan univ
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING2023-8DOI: 10.1016/j.rcim.2023.102534
28被引4阅读
引用收藏
分享

摘要

The previous studies on the flexible job shop scheduling problems (FJSP) with machine flexibility and worker flexibility normally assume that each machine is operated by one worker at any time. However, it is not accurate in many cases because many workers may be required for machines in processing complex operations. Hence, this paper studies a universal version, i.e., FJSP with worker cooperation flexibility (FJSPWC), which defines that each machine can be used only if their required workers are prepared. A mixed-integer linear programming model tuned by CPLEX is established for the problem aiming to collaboratively minimize the makespan, maximum workload of machines and maximum workload of workers. To solve the problem efficiently, a Paretobased two-stage evolutionary algorithm (PTEA) is proposed. In the PTEA, a well-tailored initialization operator and the NSGA-II structure are designed for global exploration in the first stage, and a competitive objective-based local search operator is developed to improve its local search ability and accelerate the convergence in the second stage. Extensive experiments based on fifty-eight newly formulated benchmarks are carried out to validate the effectiveness of the well-designed initialization operator and two-stage architecture. Comprehensive experiments are performed to evaluate the proposed PTEA, and the results reveal that the PTEA is superior to four comparison algorithms concerning the distribution, convergence, and overall performance.

学科与关键词

关键词
Flexible job shop schedulingCooperation flexibilityTwo-stage algorithmNSGA-IIObjective-based local search
相关
加载中…
  • A Novel Collaborative Evolutionary Algorithm with Two-Population for Multi-Objective Flexible Job Shop Scheduling
    Wang, Cuiyu; Li, Xinyu; Gao, Yiping*CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES, 2023, 137(2): 1849-1870.被引 4
  • 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
  • Energy-efficient flexible flow shop scheduling with worker flexibility
    Gong, Guiliang; Chiong, Raymond; Deng, Qianwang*; Han, Wenwu; Zhang, Like; Lin, Wenhui; Li, KexinEXPERT SYSTEMS WITH APPLICATIONS, 2020, 141: 112902.被引 105
查看全部 →

发表信息

论文状态
公开发表
期刊
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING
发表日期
2023-08
卷期
第 82 卷
页码
102534
DOI
10.1016/j.rcim.2023.102534
语言
ENGLISH
成果收录
SCIE
资助标注
National Key R & D Program of China [2018YFB1701400, 2020YFB1712100]; National Natural Science Foundation of China [72001217]; Foshan Technological Innovation Project [1920001000041]; Nature Science Foundation of Hunan [2021JJ41081]; Natural Science Foundation of Changsha [kq2007033]

作者

  • L

    Luo, Qiang (第一作者)

    hunan univ

  • D

    Deng, Qianwang (通讯)

    hunan univ

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

    Xie, Guanhua

    hunan univ

  • G

    Gong, Guiliang

    hunan univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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