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

An iterated greedy algorithm with acceleration of job allocation probability for distributed heterogeneous permutation flowshop scheduling problem

Li, Haoran; Li, Xinyu; Gao, Liang*华中科技大学
Swarm and Evolutionary Computation2024-7DOI: 10.1016/j.swevo.2024.101580
1被引4阅读
引用收藏
分享

摘要

Distributed manufacturing paradigm is becoming one of the dominant manufacturing models today. Heterogeneities between factories exist in fact due to the differences in process flexibility and machine performance. Most research focuses on identical distributed factories and overlooks the influence of heterogeneous factories on the subproblem of job allocation. This paper investigates a distributed heterogeneous permutation flowshop scheduling problem (DHPFSP) to minimize the makespan, and a mixed -integer linear programming (MILP) model is established. Building upon a special phenomenon of job assignment to a specific heterogeneous factory in DHPFSP, an iterated greedy algorithm with acceleration of job allocation probability (IGP) is proposed. To utilize this phenomenon, a job allocation probability matrix is introduced to describe the trend of job allocation, and a fast pass strategy with job allocation probability is suggested to speed up the algorithm search process. Furthermore, to generate a high -quality initial solution quickly for IGP, an NEH-based heuristic framework for distributed heterogeneous factory environment (NEHDHF) is proposed. In NEHDHF, several distinct initial job sequence generation strategies and a new first -f job allocation strategy are proposed for obtain a better initial solution. In computational experiments, there are 720 test instances designed and publicized. The IGP achieves 535 best solutions out of 720 instances. Statistically sound results demonstrate the effectiveness of the presented algorithms for the considered problem.

学科与关键词

关键词
Distributed heterogeneous permutationflowshopAcceleration of job allocation probabilityNEH-based heuristic frameworkIterated greedy algorithm
相关
加载中…
  • Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem
    Shao, Weishi; Shao, Zhongshi*; Pi, DechangKnowledge-Based Systems, 2020, 194: 105527.被引 120
  • A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
    Fernandez-Viagas, Victor*; Framinan, Jose M.International Journal of Production Research, 2015, 53(4): 1111-1123.被引 172
  • Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times
    Rossi, Fernando Luis*; Nagano, Marcelo SeidoCOMPUTERS & INDUSTRIAL ENGINEERING, 2021, 157: 107337.被引 26
查看全部 →

发表信息

论文状态
公开发表
期刊
Swarm and Evolutionary Computation
发表日期
2024-07
卷期
第 88 卷
页码
101580
DOI
10.1016/j.swevo.2024.101580
语言
ENGLISH
成果收录
SCIE
资助标注
National Natural Science Founda- tion for Distinguished Young Scholars of China [51825502]; National Natural Science Foundation of China [U21B2029]

作者

  • L

    Li, Haoran (第一作者)

    huazhong univ sci & technol

  • L

    Li, Xinyu

    huazhong univ sci & technol

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

    Gao, Liang (通讯)

    huazhong univ sci & technol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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