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

A Pareto-based discrete particle swarm optimization for parallel casting workshop scheduling problem with fuzzy processing time

Zhou, Wenhao; Chen, Fayuan; Ji, Xiaoyuan*; Li, Hailong; Zhou, Jianxin华中科技大学
Knowledge-Based Systems2022-11-28DOI: 10.1016/j.knosys.2022.109872
11被引1阅读
引用收藏
分享

摘要

The parallel casting workshop scheduling problem is essentially a type of unrelated parallel machine scheduling (UPMS) problem with fuzzy order processing time. In this paper, a tri-objective parallel casting workshop optimization model is investigated to minimize the order advance/delay penalty, makespan, and workload imbalance, and a formula of the solution scale with the number of orders and workshops is derived. In line with the multi-objective integer programming model, a new Pareto-based discrete particle swarm optimization (PDPSO) is proposed. In this algorithm, the particles are encoded with integers. A novel two-phase heuristic is developed for integer-encoded particle updates. The first phase determines the order assignment through a weighting vote, and the second phase sorts the orders according to their dominance in each workshop. Every particle's update is simultaneously guided by the best compromise solution selected from the personal and global Pareto solution. Meanwhile, the Pareto simulated annealing strategy is introduced in PDPSO to enhance its exploration ability. Multiple simulations under different scales are tested to validate the effectiveness of our proposed model and algorithm. The results show that the proposed PDPSO outperforms the other two multi-objective algorithms and has large advantages in finding the Pareto frontier (PF) with an acceptable solution number and solving speed, especially for small and medium-sized instances.

学科与关键词

关键词
Discrete particle swarm optimizationParallel machine schedulingFuzzy processing timeSimulated annealingMulti -objective algorithm
相关
加载中…
  • A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem
    Torabi, S. A.*; Sahebjamnia, N.; Mansouri, S. A.; Bajestani, M. AramonAPPLIED SOFT COMPUTING, 2013, 13(12): 4750-4762.被引 98
  • A Discrete Particle Swarm Optimization Algorithm With Adaptive Inertia Weight for Solving Multiobjective Flexible Job-shop Scheduling Problem
    Gu, Xiao-Lin*; Huang, Ming; Liang, XuIEEE Access, 2020, 8: 33125-33136.被引 13
  • A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS
    Ge, H. W.; Liang, Y. C.*; Zhou, Y.; Guo, X. C.International Journal of Computational Methods, 2005, 2(3): 419-430.被引 20
查看全部 →

发表信息

论文状态
公开发表
期刊
Knowledge-Based Systems
发表日期
2022-11-28
卷期
第 256 卷
页码
109872
DOI
10.1016/j.knosys.2022.109872
语言
ENGLISH
期刊等级
1区
成果收录
SCIE
资助标注
National Key Re- search and Development Program, China; National Natural Science Foundation of China; [2020YFB1710100]; [51905188]; [52090042]

作者

  • Z

    Zhou, Wenhao (第一作者)

    huazhong univ sci & technol

  • C

    Chen, Fayuan

    huazhong univ sci & technol

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

    Ji, Xiaoyuan (通讯)

    huazhong univ sci & technol

  • L

    Li, Hailong

    huazhong univ sci & technol

  • Z

    Zhou, Jianxin

    huazhong univ sci & technol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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