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

Mathematical modeling and hybrid evolutionary algorithm to schedule flexible job shop with discrete operation sequence flexibility

Yuan, Shuai; Zhu, Xiaomin; Cai, Wei; Gao, Jinsheng; Zhang, Runtong*北京交通大学
COMPUTERS & OPERATIONS RESEARCH2025-4DOI: 10.1016/j.cor.2024.106952
3阅读
引用收藏
分享

摘要

In actual industrial production, several operations of a job may not have precedence relationships and can be placed at any point in the process route. However, traditional flexible job shop scheduling problems (FJSP) often assume that all operations of each job must be processed in strict linear order. Therefore, this research addresses the FJSP with discrete operation sequence flexibility (FJSPDS) with the objective of minimizing the makespan. Based on existing models, two novel mixed-integer linear programming (MILP) models are formulated by improving the description methods of variables and constraints, significantly enhancing the models' performance. Additionally, a hybrid evolutionary algorithm (HEA) is proposed to solve large-scale instances through the following three aspects. An improved encoding method is proposed, which makes the search space of the HEA and solution space of the problem more compatible and reduces the possibility of optimal solutions being missed. A special neighborhood structure is designed according to the characters of sequence-free operations, and an iterative local search method is introduced to improve the quality of the solution. A knowledge-driven reinitialization operator is developed, which generates new individuals based on the features of the historical elite population, guiding the evolution of populations, avoiding premature convergence while also avoiding falling into local optima. Finally, a total of 110 benchmark problem instances are utilized to verify the superior effectiveness of the MILP models and the HEA in solving FJSPDS.

学科与关键词

关键词
Flexible job shop schedulingMixed-integer linear programming modelDiscrete operation sequence flexibilityHybrid evolutionary algorithmKnowledge-driven reinitializationIterative local search
相关
加载中…
  • Energy-efficient flexible job shop scheduling problem considering discrete operation sequence flexibility
    Gong, Guiliang; Tang, Jiuqiang*; Huang, Dan; Luo, Qiang; Zhu, Kaikai; Peng, NingtaoSwarm and Evolutionary Computation, 2024, 84: 101421.被引 7
  • 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
  • Mathematical modeling and a hybridized bacterial foraging optimization algorithm for the flexible job-shop scheduling problem with sequencing flexibility
    Vital-Soto, Alejandro; Azab, Ahmed*; Baki, Mohammed FazleJOURNAL OF MANUFACTURING SYSTEMS, 2020, 54: 74-93.被引 50
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPUTERS & OPERATIONS RESEARCH
发表日期
2025-04
卷期
第 176 卷
页码
106952
DOI
10.1016/j.cor.2024.106952
语言
ENGLISH
成果收录
SCIE
资助标注
National Natural Science Foundation of China [62173025]

作者

  • Y

    Yuan, Shuai (第一作者)

    beijing jiaotong univ

  • Z

    Zhu, Xiaomin

    beijing jiaotong univ

查看全部 5 位作者收起作者
  • C

    Cai, Wei

    beijing jiaotong univ

  • G

    Gao, Jinsheng

    north china elect power univ

  • Z

    Zhang, Runtong (通讯)

    beijing jiaotong univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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