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

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-Yan华中科技大学; 上海大学
Swarm and Evolutionary Computation2022-12DOI: 10.1016/j.swevo.2022.101179
14被引3阅读
引用收藏
分享

摘要

In today's global economy, distributed manufacturing has become increasingly appropriate. Job setup time is invariably a factor in manufacturing, and needs to be considered when making scheduling decisions. This study aims to minimize the total flow time by solving a distributed permutation flowshop scheduling problem (DPFSP) with a sequence-dependent setup time (SDST) to minimize total flowtime. First, to manage the DPFSP/SDST effectively, we propose a constructive heuristic framework based on the LR heuristic, which contains three constructive heuristics to obtain good initial solutions. Second, a discrete artificial bee colony (DABC) method based on variable neighborhood structures (DABCvns) is proposed. By analyzing the problem-specific charac-teristics in the DABCvns, four different neighborhood structures are proposed, which are selectively applied in three stages of DABCvns to obtain more feasible neighborhood solutions. In addition, two variable neighborhood descent algorithms are proposed, which are each based on local search methods. The algorithms are developed to improve the best solution obtained in initial population and the best solution generated in the three stages. Finally, we conduct an experiment to calibrate the parameter of the DABCvns method. To evaluate the perfor-mance of the proposed method compared to six other algorithms, comprehensive computational experiments are conducted. The simulation results indicate that the proposed method delivers the best quality solutions for the DPFSP/SDST in the minimization of total flowtime.

学科与关键词

关键词
FlowshopSchedulingSetup timesTotal flowtimeArtificial bee colonyVariable neighborhood
相关
加载中…
  • 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
  • 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
  • Collaborative variable neighborhood search for multi-objective distributed scheduling in two-stage hybrid flow shop with sequence-dependent setup times
    Cai, Jingcao*; Lu, Shejie*; Cheng, Jun*; Wang, Lei*; Gao, Yin*; Tan, TielongScientific Reports, 2022, 12(1): 15724.被引 4
查看全部 →

发表信息

论文状态
公开发表
期刊
Swarm and Evolutionary Computation
发表日期
2022-12
卷期
第 75 卷
页码
101179
DOI
10.1016/j.swevo.2022.101179
语言
ENGLISH
期刊等级
1区
成果收录
SCIE
资助标注
National Natural Science Foundation of China [62273221, 61973203, 61803192]; Natural Science Foundation of Liaoning Province of China [2021-BS-189]; Department of Education of Liaoning Province (CN) [JYT2020016]; Youth Innovation Talent Introduction and Education Program from Shandong province colleges and universities

作者

  • Y

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

    shanghai univ · shenyang aerosp univ

  • Z

    Zhang, Feng-Qi

    shenyang aerosp univ

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

    Yang, Guo-Dong

    shenyang aerosp univ

  • W

    Wang, Yu

    shenyang aerosp univ

  • H

    Huang, Jiang-Ping

    huazhong univ sci & technol

  • H

    Han, Yu-Yan

    liaocheng univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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