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

An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness

Naderi, B.; Zandieh, M.*; Balagh, A. Khaleghi Ghoshe; Roshanaei, V.
EXPERT SYSTEMS WITH APPLICATIONS2009-8DOI: 10.1016/j.eswa.2008.09.063
142被引12阅读
引用收藏
分享

摘要

In this communication, we strive to apply a novel simulated annealing to consider scheduling hybrid flowshop problems to minimize both total completion time and total tardiness. To narrow the gap between the theory and the practice of the hybrid flowshop scheduling, we integrate two realistic and practical assumptions which are sequence-dependent setup and transportation times into our problem. We apply a metaheuristic based on simulated annealing (SA) which strikes a compromise between intensification and diversification mechanisms to augment the competitive performance of our proposed SA. A comprehensive calibration of different parameters and operators are done. We employ Taguchi method to select the optimum parameters with the least possible number of experiments. For the purpose of performance evaluation of our proposed algorithm, we generate a benchmark against which the adaptations of high performing algorithms in the literature are brought into comparison. Moreover, we investigate the impacts of increase of number of jobs on the Performance of our algorithm. The efficiency and effectiveness of our hybrid simulated annealing are inferred from all the computational results obtained in various situations.

学科与关键词

关键词
SchedulingHybrid flowshopTransportation timeSequence-dependent setup timesTotal tardinessTotal completion timeHybrid simulated annealingLocal search
相关
加载中…
  • Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness
    Naderi, B.; Zandieh, M.*; Roshanaei, V.INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 41(11-12): 1186-1198.被引 85
  • An adaptive hybrid metaheuristic for permutation flowshop scheduling
    Moccellin, JV*; dos Santos, MOCONTROL AND CYBERNETICS, 2000, 29(3): 761-771.被引 3
  • A novel metaheuristic approach for the flow shop scheduling problem
    Nearchou, ACENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2004, 17(3): 289-300.被引 38
查看全部 →

发表信息

论文状态
公开发表
期刊
EXPERT SYSTEMS WITH APPLICATIONS
发表日期
2009-08
卷期
第 36 卷, 第 6 期
页码
9625-9633
DOI
10.1016/j.eswa.2008.09.063
语言
ENGLISH
成果收录
SCIE

作者

  • N

    Naderi, B. (第一作者)

  • Z

    Zandieh, M. (通讯)

查看全部 4 位作者收起作者
  • B

    Balagh, A. Khaleghi Ghoshe

  • R

    Roshanaei, V.

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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