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

A hybrid harmony search algorithm for the flexible job shop scheduling problem

Yuan, Yuan; Xu, Hua*; Yang, Jiadong清华大学
APPLIED SOFT COMPUTING2013-7DOI: 10.1016/j.asoc.2013.02.013
133被引10阅读
引用收藏
分享

摘要

In this paper, a novel hybrid harmony search (HHS) algorithm based on the integrated approach, is proposed for solving the flexible job shop scheduling problem (FJSP) with the criterion to minimize makespan. First of all, to make the harmony search (HS) algorithm adaptive to the FJSP, the converting techniques are developed to convert the continuous harmony vector to a kind of discrete two-vector code for the FJSP. Secondly, the harmony vector is mapped into a feasible active schedule through effectively decoding the transformed two-vector code, which could largely reduce the search space. Thirdly, a resultful initialization scheme combining heuristic and random strategies is introduced to make the initial harmony memory (HM) occur with certain quality and diversity. Furthermore, a local search procedure is embedded in the HS algorithm to enhance the local exploitation ability, whereas HS is employed to perform exploration by evolving harmony vectors in the HM. To speed up the local search process, the improved neighborhood structure based on common critical operations is presented in detail. Empirical results on various benchmark instances validate the effectiveness and efficiency of our proposed algorithm. Our work also indicates that a well designed HS-based method is a competitive alternative for addressing the FJSP.

学科与关键词

关键词
SchedulingFlexible job shopHarmony searchLocal searchNeighborhood structureMakespan
相关
加载中…
  • 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 Novel Hybrid Whale Optimization Algorithm for Flexible Job-Shop Scheduling Problem
    Yang, Wenqiang; Su, Jinzhe; Yao, Yunhang; Yang, Zhile*; Yuan, YingMachines, 2022, 10(8): 618.被引 11
  • Hybrid quantum particle swarm optimization and variable neighborhood search for flexible job-shop scheduling problem
    Xu, Yuanxing; Zhang, Mengjian; Yang, Ming; Wang, Deguang*JOURNAL OF MANUFACTURING SYSTEMS, 2024, 73: 334-348.被引 9
查看全部 →

发表信息

论文状态
公开发表
期刊
APPLIED SOFT COMPUTING
发表日期
2013-07
卷期
第 13 卷, 第 7 期
页码
3259-3272
DOI
10.1016/j.asoc.2013.02.013
语言
ENGLISH
期刊等级
Q1
成果收录
SCIE
资助标注
National Natural Science Foundation of China [61175110]; National S&T Major Projects of China [2011ZX02101-004]; National Basic Research Program of China (973 Program) [2012CB316305]

作者

  • Y

    Yuan, Yuan (第一作者)

    tsinghua univ

  • X

    Xu, Hua (通讯)

    tsinghua univ

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

    Yang, Jiadong

    tsinghua univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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