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

Total completion time with makespan constraint in no-wait flowshops with setup times

Allahverdi, Ali*; Aydilek, Harun
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH2014-11-1DOI: 10.1016/j.ejor.2014.04.031
32被引3阅读
引用收藏
分享

摘要

The m-machine no-wait flowshop scheduling problem with the objective of minimizing total completion time subject to the constraint that the makespan value is not greater than a certain value is addressed in this paper. Setup times are considered non-zero values, and thus, setup times are treated as separate from processing times. Several recent algorithms, an insertion algorithm, two genetic algorithms, three simulated annealing algorithms, two cloud theory-based simulated annealing algorithms, and a differential evolution algorithm are adapted and proposed for the problem. An extensive computational analysis has been conducted for the evaluation of the proposed algorithms. The computational analysis indicates that one of the nine proposed algorithms, one of the simulated annealing algorithms (ISA-2), performs much better than the others under the same computational time. Moreover, the analysis indicates that the algorithm ISA-2 performs significantly better than the earlier existing best algorithm. Specifically, the best performing algorithm, ISA-2, proposed in this paper reduces the error of the existing best algorithm in the literature by at least 90% under the same computational time. All the results have been statistically tested.

学科与关键词

关键词
SchedulingNo-wait flowshopSetup timesTotal completion timeMakespan
相关
加载中…
  • No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
    Allahverdi, Ali*; Aydilek, Harun; Aydilek, AsiyeAPPLIED MATHEMATICS AND COMPUTATION, 2020, 365: 124688.被引 31
  • No-wait flowshops with bicriteria of makespan and total completion time
    Allahverdi, A*; Aldowaisan, TJournal of the Operational Research Society, 2002, 53(9): 1004-1015.被引 38
  • Distributed no-wait flow shop problem with sequence dependent setup time: Optimization of makespan and maximum tardiness
    Allali, Karam*; Aqil, Said; Belabid, JabraneSIMULATION MODELLING PRACTICE AND THEORY, 2022, 116: 102455.被引 28
查看全部 →

发表信息

论文状态
公开发表
期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
发表日期
2014-11-01
卷期
第 238 卷, 第 3 期
页码
724-734
DOI
10.1016/j.ejor.2014.04.031
语言
ENGLISH
期刊收录
SCIE
期刊等级
Q1
成果收录
SCIE
资助标注
Kuwait University Research Administration [EI03/11]

作者

  • A

    Allahverdi, Ali (通讯) (第一作者)

  • A

    Aydilek, Harun

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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