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

A population-based iterated greedy algorithm for no-wait job shop scheduling with total flow time criterion

Deng, Guanlong*; Su, Qingtang; Zhang, Zhiwang; Liu, Huixia; Zhang, Shuning; Jiang, Tianhualudong univ
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE2020-2DOI: 10.1016/j.engappai.2019.103369
34被引4阅读
引用收藏
分享

摘要

The no-wait job shop where no waiting time is allowed between two successive operations of a job has a strong industrial background, especially in steel-making industry and concrete manufacturing. This study formulates the no-wait job shop problem with a total flow time criterion based on time difference and decomposes the problem into timetabling and sequencing subproblems. Several timetabling methods are designed for the total flow time criterion to generate a sequence timetable. By adopting favourable features of the iterated greedy algorithm, the population-based iterated greedy (PBIG) algorithm for the sequencing subproblem is proposed. The individuals in the population evolve by means of a destruction and construction perturbator and an insertion-based local search. In each iteration, a tournament selection is designed to replace a relatively worse solution. In order to generate starting solutions with a certain quality and diversity, the Nawaz-Enscore-Ham-based heuristics for flow shop scheduling are extended in no-wait job shops. In computational experiments based on well-known benchmark instances, timetabling methods are investigated, and it is shown that the left timetabling is superior to other timetabling methods for the total flow time minimisation. Computational results also show that the proposed algorithm significantly outperforms several state-of-the-art metaheuristics, and it could be applicable to practical production environment.

学科与关键词

关键词
SchedulingJob shopFlow shopNo-waitMetaheuristicsEvolutionary algorithms
相关
加载中…
  • An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion
    Pan, Quan-Ke*; Wang, Ling; Zhao, Bao-HuaINTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 38(7-8): 778-786.被引 88
  • Iterative search method for total flowtime minimization no-wait flowshop problem
    Zhu, Xia*; Li, XiaopingInternational Journal of Machine Learning and Cybernetics, 2015, 6(5): 747-761.被引 9
  • A cooperative coevolutionary algorithm approach to the no-wait job shop scheduling problem
    Valenzuela-Alcaraz, Victor M.; Cosio-Leon, M. A.; Danisa Romero-Ocano, A.; Brizuela, Carlos A.*EXPERT SYSTEMS WITH APPLICATIONS, 2022, 194: 116498.被引 10
查看全部 →

发表信息

论文状态
公开发表
期刊
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
发表日期
2020-02
卷期
第 88 卷
页码
103369
DOI
10.1016/j.engappai.2019.103369
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
1区
成果收录
SCIE
资助标注
Shandong Provincial Natural Science Foundation, China [ZR2018MF024]; National Natural Science Foundation of China [61403180, 61771231, 61877061, 61603172]

作者

  • D

    Deng, Guanlong (通讯) (第一作者)

    ludong univ

  • S

    Su, Qingtang

    ludong univ

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

    Zhang, Zhiwang

    ludong univ

  • L

    Liu, Huixia

    ludong univ

  • Z

    Zhang, Shuning

    ludong univ

  • J

    Jiang, Tianhua

    ludong univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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