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

Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem

Pan, Quan-Ke; Gao, Liang*; Wang, Ling; Liang, Jing; Li, Xin-Yu华中科技大学; 清华大学; 上海大学; 郑州大学
EXPERT SYSTEMS WITH APPLICATIONS2019-6-15DOI: 10.1016/j.eswa.2019.01.062
217被引4阅读
引用收藏
分享

摘要

Distributed permutation flowshop scheduling problem (DPFSP) has become a very active research area in recent years. However, minimizing total fiowtime in DPFSP, a very relevant and meaningful objective for today's dynamic manufacturing environment, has not captured much attention so far. In this paper, we address the DPFSP with total flowtime criterion. To suit the needs of different CPU time demands and solution quality, we present three constructive heuristics and four metaheuristics. The constructive heuristics are based on the well-known LR and NEH heuristics. The metaheuristics are based on the high-performing frameworks of discrete artificial bee colony, scatter search, iterated local search, and iterated greedy, which have been applied with great success to closely related scheduling problems. We explore the problem-specific knowledge and accelerations to evaluate neighboring solutions for the considered problem. We introduce advanced and effective technologies like a referenced local search, a strategy to escape from local optima, and an enhanced intensive search method for the presented metaheuristics. A comprehensive computational campaign against the closely related and well performing algorithms in the literature is carried out. The results show that both the presented constructive heuristics and meta heuristics are very effective for solving the DPFSP with total fiowtime criterion.

学科与关键词

关键词
SchedulingFlowshopArtificial bee colonyScatter searchIterated local searchIterated greedy
相关
加载中…
  • The distributed permutation flow shop to minimise the total flowtime
    Fernandez-Viagas, Victor*; Perez-Gonzalez, Paz; Framinan, Jose M.COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 118: 464-477.被引 133
  • Improved Meta-Heuristics for Solving Distributed Lot-Streaming Permutation Flow Shop Scheduling Problems
    Pan, Yuxia; Gao, Kaizhou; Li, Zhiwu*; Wu, NaiqiIEEE Transactions on Automation Science and Engineering, 2023, 20(1): 361-371.被引 58
  • Acceleration-based artificial bee colony optimizer for a distributed permutation flowshop scheduling problem with sequence-dependent setup times
    Yu, Yang*; Zhang, Feng-Qi; Huang, Jiang -PingAPPLIED SOFT COMPUTING, 2023, 135: 110029.被引 9
查看全部 →

发表信息

论文状态
公开发表
期刊
EXPERT SYSTEMS WITH APPLICATIONS
发表日期
2019-06-15
卷期
第 124 卷
页码
309-324
DOI
10.1016/j.eswa.2019.01.062
语言
ENGLISH
成果收录
SCIE
资助标注
National Science Foundation of China [51575212, 51775216, 61876169, 61873328]; National Natural Science Fund for Distinguished Young Scholars of China [51825502, 61525304]; Shanghai Key Laboratory of Power station Automation Technology

作者

  • P

    Pan, Quan-Ke (第一作者)

    shanghai univ · liaocheng univ

  • G

    Gao, Liang (通讯)

    huazhong univ sci & technol

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

    Wang, Ling

    tsinghua univ

  • L

    Liang, Jing

    zhengzhou univ

  • L

    Li, Xin-Yu

    huazhong univ sci & technol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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