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

Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times

Rossi, Fernando Luis*; Nagano, Marcelo Seido
COMPUTERS & INDUSTRIAL ENGINEERING2021-7DOI: 10.1016/j.cie.2021.107337
26被引2阅读
引用收藏
分享

摘要

The distributed permutation flowshop scheduling problem (DPFSP) has attracted a lot of attention in recent years, as current production systems frequently operate multiple factories at once. Due to the practical relevance of mixed no-idle flowshop, we address an extension of the DPFSP where there are identical factories, each one with a mixed no-idle flowshop environment. In a mixed no-idle flowshop regular machines exist side-by-side with stages that require a non-stop process. The addressed problem also takes into account sequence-dependent setup times on conventional machines. To the extent of our knowledge, this issue has not yet been examined in the literature despite it can be encountered in current manufacturing systems. For the purpose, we present a MILP formulation, a novel constructive heuristic and iterated greedy algorithms. A new construction scheme based on inter-factory and intra-factory improvement schemes is provided for the novel heuristic to further improve the solution quality given by the method. For the iterated greedy algorithm, we developed a new efficient reconstruction strategy to enhance the exploration capability of the algorithm. Furthermore, a large new benchmark was generated using a well recognized set of instances. The state-of-the-art methods and our proposed algorithms were tested in an extensive statistical and computational experiment. The analysis show that our proposals outperformed the methods from the literature.

学科与关键词

关键词
SchedulingDistributed flowshopSetup timesNo-idleMakespan
相关
加载中…
  • An effective iterated greedy method for the distributed permutation fl owshop scheduling problem with sequence-dependent setup times
    Huang, Jiang-Ping; Pan, Quan-Ke*; Gao, LiangSwarm and Evolutionary Computation, 2020, 59: 100742.被引 96
  • 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
  • Minimising makespan in distributed mixed no-idle flowshops
    Cheng, Chen-Yang; Ying, Kuo-Ching*; Chen, Hsia-Hsiang; Lu, Hsiao-ShanInternational Journal of Production Research, 2019, 57(1): 48-60.被引 40
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPUTERS & INDUSTRIAL ENGINEERING
发表日期
2021-07
卷期
第 157 卷
页码
107337
DOI
10.1016/j.cie.2021.107337
语言
MULTI-LANGUAGE
期刊等级
2区
成果收录
SCIE
资助标注
National Council for Scientific and Technological Development (CNPq) [306075/2017-2, 430137/2018-4]; Brazilian Ministry of Science, Technology, and Innovation (MCTI)

作者

  • R

    Rossi, Fernando Luis (通讯) (第一作者)

  • N

    Nagano, Marcelo Seido

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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