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

Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem

Shao, Weishi; Shao, Zhongshi*; Pi, Dechang南京航空航天大学
Knowledge-Based Systems2020-4-22DOI: 10.1016/j.knosys.2020.105527
120被引5阅读
引用收藏
分享

摘要

As economic globalization, large manufacturing enterprises build production centers in different places to maximize profit. Therefore, scheduling problems among multiple production centers should be considered. This paper studies a distributed hybrid flow shop scheduling problem (DHFSP) with makespan criterion, which combines the characteristic of distributed flow shop scheduling and parallel machine scheduling. In the DHFSP, a set of jobs are assigned into a set of identical factories to process. Each job needs to be through same route with a set of stages, and each stage has several machines in parallel and at least one of stage has more than one machine. For solving the DHFSP, this paper proposes two algorithms: DNEH with smallest-medium rule and multi-neighborhood iterated greedy algorithm. The DNEH with smallest-medium rule constructive heuristic first generates a seed sequence by decomposition and smallest-medium rule, and then uses a greedy iteration to assign jobs to factories. In the iterated greedy algorithm, a multi-search construction is proposed, which applies the greedy insertion to the factory again after inserting a new job. Then, a multi-neighborhood local search is utilized to enhance local search ability. The proposed algorithms are evaluated by a comprehensive comparison, and the experimental results demonstrate that the proposed algorithms are very competitive for solving the DHFSP.

学科与关键词

关键词
Distributed hybrid flow shop scheduling problemIterated greedy algorithmMulti-neighborhoodDecomposition based heuristicMakespan
相关
加载中…
  • 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 Computation, 2024, 88: 101580.被引 1
  • 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
  • Multi-objective evolutionary algorithm based on multiple neighborhoods local search for multi-objective distributed hybrid flow shop scheduling problem
    Shao, Weishi; Shao, Zhongshi*; Pi, DechangEXPERT SYSTEMS WITH APPLICATIONS, 2021, 183: 115453.被引 63
查看全部 →

发表信息

论文状态
公开发表
期刊
Knowledge-Based Systems
发表日期
2020-04-22
卷期
第 194 卷
页码
105527
DOI
10.1016/j.knosys.2020.105527
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
1区
成果收录
SCIE
资助标注
Natural Science Research of Jiangsu Higher Education Institutions of China [19KJB520042]; Shaanxi Normal University; Nanjing Normal University

作者

  • S

    Shao, Weishi (第一作者)

    nanjing normal univ

  • S

    Shao, Zhongshi (通讯)

    shaanxi normal univ

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

    Pi, Dechang

    nanjing univ aeronaut & astronaut

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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