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

An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals

Wang, Zhen; Zhang, Jihui*; Yang, Shengxiang青岛大学
Swarm and Evolutionary Computation2019-12DOI: 10.1016/j.swevo.2019.100594
91被引1阅读
引用收藏
分享

摘要

Random job arrivals that happen frequently in manufacturing practice may create a need for dynamic scheduling. This paper considers an issue of how to reschedule the randomly arrived new jobs to pursue both performance and stability of a schedule in a job shop. Firstly, a mixed integer programming model is established to minimize three objectives, including the discontinuity rate of new jobs during the processing, the makespan deviation of initial schedule, and the sequence deviation on machines. Secondly, four match-up strategies from references are modified to determine the rescheduling horizon. Once new jobs arrive, the rescheduling process is immediately triggered with ongoing operations remain. The ongoing operations are treated as machine unavailable constraints (MUC) in the rescheduling horizon. Then, a particle swarm optimization (PSO) algorithm with improvements is proposed to solve the dynamic job shop scheduling problem. Improvement strategies consist of a modified decoding scheme considering MUC, a population initialization approach by designing a new transformation mechanism, and a novel particle movement method by introducing position changes and a random inertia weight. Lastly, extensive experiments are conducted on several instances. The experiments results show that the modified rescheduling strategies are statistically and significantly better than the compared strategies. Moreover, comparative studies with five variants of PSO algorithm and three state-of-the-art meta-heuristics demonstrate the high performance of the improved PSO algorithm.

学科与关键词

关键词
New job arrivalDynamic job shop schedulingMatch-up strategyParticle swarm optimizationMulti-objective problem
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
Swarm and Evolutionary Computation
发表日期
2019-12
卷期
第 51 卷
页码
100594
DOI
10.1016/j.swevo.2019.100594
语言
ENGLISH
成果收录
SCIE
资助标注
Natural Science Foundation of China [61673228, 61703220, 61402216]; Natural Science Foundation of Shandong Province [ZR2010GM006]

作者

  • W

    Wang, Zhen (第一作者)

    qingdao univ

  • Z

    Zhang, Jihui (通讯)

    qingdao univ

查看全部 3 位作者收起作者
  • Y

    Yang, Shengxiang

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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