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

Energy-efficient flexible job shop scheduling problem considering discrete operation sequence flexibility

Gong, Guiliang; Tang, Jiuqiang*; Huang, Dan; Luo, Qiang; Zhu, Kaikai; Peng, Ningtaohunan univ
Swarm and Evolutionary Computation2024-2DOI: 10.1016/j.swevo.2023.101421
7被引2阅读
引用收藏
分享

摘要

The classical flexible job shop scheduling problem (FJSP) normally assumes that operations of each job have strict sequence constraints, i.e., each operation can be processed only after its previous operation is completed. However, in the actual production, the phenomenon that some operations of a job don't have any sequence constraints is very common. With regard to this, we firstly propose a FJSP with discrete operation sequence flexibility (FJSPDS) aiming at minimizing the makespan and total energy consumption, simultaneously. An effective mathematical model is established for the FJSPDS and its validity is proved by the CPLEX; and then an improved memetic algorithm (IMA) is designed to solve the FJSPDS. In the IMA, a new flexible sequencing method for determining process plan of each job and a right-leaning decoding method are proposed. And some effective crossover and mutation operators and an effective local search operator are designed to accelerate the convergence speed and expand the solution space of the algorithm. A total of 110 FJSPDS benchmark instances are constructed to conduct numerical simulation experiments. Experimental results show that our proposed IMA has superior performance in almost all of the instances compared with three well-known evolutionary algorithms. Our proposed model and algorithm can help the production managers who work with flexible manufacturing systems to obtain optimal scheduling schemes considering operations which have or don't have sequence constraints.

学科与关键词

关键词
Flexible job shop scheduling problemImproved memetic algorithmDiscrete operation sequence flexibilityFlexible sequencing methodGreen production
相关
加载中…
  • 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 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 RESEARCH, 2025, 176: 106952.
  • Enhanced memetic search for reducing energy consumption in fuzzy flexible job shops
    Garcia Gomez, Pablo; Gonzalez-Rodriguez, Ines; Vela, Camino R.*INTEGRATED COMPUTER-AIDED ENGINEERING, 2023, 30(2): 151-167.被引 9
查看全部 →

发表信息

论文状态
公开发表
期刊
Swarm and Evolutionary Computation
发表日期
2024-02
卷期
第 84 卷
页码
101421
DOI
10.1016/j.swevo.2023.101421
语言
ENGLISH
成果收录
SCIE
资助标注
National Natural Science Foundation of China [72001217]; Natural Science Foundation of Hunan [2021JJ41081, 2022JJ40860]; Changsha Soft Science Research Program [kh2302004]; Hunan Provincial Department of Education Project [22A0170]; Hunan Provincial Innovation Foundation For Postgraduate [CX20220736]

作者

  • G

    Gong, Guiliang (第一作者)

    hunan univ

  • T

    Tang, Jiuqiang (通讯)

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

    Huang, Dan

  • L

    Luo, Qiang

    hunan univ

  • Z

    Zhu, Kaikai

  • P

    Peng, Ningtao

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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