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

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 -Ping华中科技大学; 上海大学
APPLIED SOFT COMPUTING2023-3DOI: 10.1016/j.asoc.2023.110029
9被引2阅读
引用收藏
分享

摘要

The distributed permutation flowshop scheduling problem (DPFSP) has attracted a lot of attentions in recent years. Furthermore, sequence-dependent setup time (SDST) often occurs in the job's production, and total flowtime becomes a more important and meaningful objective for the modern dynamic productive environment. Therefore, the DPFSP with SDST under minimization of total flowtime is investigated in this paper, and the mathematical model is established. To solve the problem, this paper presents three constructive heuristics and an effective discrete artificial bee colony (EDABC) method based on the acceleration. In the EDABC, the constructive heuristics are used to initialize population. Moreover, based on the problem-specific of sequence-dependent, the employed bees stage, onlooker bees stage and scout bees stage are improved by exploring the acceleration methods to evaluate the neighboring solutions. Further, to strengthen the performance of the proposed algorithm, three effective problem-oriented local search methods are developed, including referenced local search (RLS), improved local search 1 (ILS1) and improved local search 2 (ILS2). RLS is used to the best solution after the initialization, and ILS1 and ILS2 are designed in the framework of improved variable neighborhood descent. The extensive computational experiences are carried out, and the results show that the proposed methods, including three heuristics and EDABC, have outstanding performance for the SDST/DPFSP to minimize the total flowtime.

学科与关键词

关键词
Distributed permutation flowshopSetup timesTotal flowtimeArtificial bee colonyLocal search
相关
加载中…
  • A discrete artificial bee colony method based on variable neighborhood structures for the distributed permutation flowshop problem with sequence-dependent setup times
    Yu, Yang*; Zhang, Feng-Qi; Yang, Guo-Dong; Wang, Yu; Huang, Jiang-Ping; Han, Yu-YanSwarm and Evolutionary Computation, 2022, 75: 101179.被引 14
  • 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-YuEXPERT SYSTEMS WITH APPLICATIONS, 2019, 124: 309-324.被引 217
  • Effective hybrid discrete artificial bee colony algorithms for the total flowtime minimization in the blocking flowshop problem
    Han, Yu-Yan*; Liang, J. J.; Pan, Quan-Ke; Li, Jun-Qing; Sang, Hong-Yan; Cao, N. N.INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 67(1-4): 397-414.被引 38
查看全部 →

发表信息

论文状态
公开发表
期刊
APPLIED SOFT COMPUTING
发表日期
2023-03
卷期
第 135 卷
页码
110029
DOI
10.1016/j.asoc.2023.110029
语言
ENGLISH
成果收录
SCIE
资助标注
National Science Foundation of China [62273221, 61973203, 61773269]; Natural Science Foundation of Liaoning Province of China [2021-BS -189]; Department of Education of Liaoning Province [JYT2020016]; Program of Shanghai Academic/Technology Re- search Leader [21XD1401000]

作者

  • Y

    Yu, Yang (通讯) (第一作者)

    shanghai univ · shenyang aerosp univ

  • Z

    Zhang, Feng-Qi

    shenyang aerosp univ

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

    Huang, Jiang -Ping

    huazhong univ sci & technol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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