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

A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers

Pan, Quan-Ke; Wang, Ling; Gao, Liang*华中科技大学; 清华大学
APPLIED SOFT COMPUTING2011-12DOI: 10.1016/j.asoc.2011.05.033
61被引2阅读
引用收藏
分享

摘要

In this paper, a chaotic harmony search (CHS) algorithm is proposed to minimize makespan for the permutation flow shop scheduling problem with limited buffers. First of all, to make the harmony search algorithm suitable for solving the problem under consideration, a rank-of-value rule is applied to convert continuous harmony vectors to discrete job permutations. Secondly, an efficient initialization scheme based on the Nawaz-Enscore-Ham heuristic [M. Nawaz, E.E.J. Enscore, I. Ham, A heuristic algorithm for the m-machine, n-job flow shop sequencing problem, OMEGA-International Journal of Management Science 11 (1983) 91-95] and its variants is presented to construct an initial harmony memory with a certain level of quality and diversity. Thirdly, a new improvisation scheme is developed to well inherit good structures from the best harmony vector in the last generation. In addition, a chaotic local search algorithm with probabilistic jumping scheme is presented and embedded in the proposed CHS algorithm to enhance the local searching ability. Computational simulations and comparisons based on the well-known benchmark instances are provided. It is shown that the proposed CHS algorithm generates better results not only than the two recently developed harmony search algorithms but also than the existing hybrid genetic algorithm and hybrid particle swarm optimization in terms of solution quality and robustness.

学科与关键词

关键词
Flow shop with limited buffersMakespanHarmony search algorithmChaotic optimization
相关
加载中…
  • A hybrid harmony search algorithm with efficient job sequence scheme and variable neighborhood search for the permutation flow shop scheduling problems
    Zhao, Fuqing*; Liu, Yang; Zhang, Yi; Ma, Weimin; Zhang, ChuckENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2017, 65: 178-199.被引 65
  • A hybrid harmony search algorithm for the flexible job shop scheduling problem
    Yuan, Yuan; Xu, Hua*; Yang, JiadongAPPLIED SOFT COMPUTING, 2013, 13(7): 3259-3272.被引 133
  • Scheduling Optimization in Flowline Manufacturing Cell Considering Intercell Movement with Harmony Search Approach
    Huang, Zhuang; Yang, Jianjun*Mathematics, 2020, 8(12): 2225.被引 3
查看全部 →

发表信息

论文状态
公开发表
期刊
APPLIED SOFT COMPUTING
发表日期
2011-12
卷期
第 11 卷, 第 8 期
页码
5270-5280
DOI
10.1016/j.asoc.2011.05.033
语言
ENGLISH
成果收录
SCIE
资助标注
National Science Foundation of China [60874075, 70871065, 60834004, 60774082]; National 863 Hi-Tech R and D Plan [2007AA04Z155]; Open Research Foundation from State Key Laboratory of Digital Manufacturing Equipment and Technology (Huazhong University of Science and Technology); SRF; Postdoctoral Science Foundation of China [20070410791]

作者

  • P

    Pan, Quan-Ke (第一作者)

    liaocheng univ · huazhong univ sci & technol

  • W

    Wang, Ling

    tsinghua univ

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

    Gao, Liang (通讯)

    huazhong univ sci & technol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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