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

An effective hybrid particle swarm optimization for no-wait flow shop scheduling

Liu, Bo*; Wang, Ling; Jin, Yi-Hui清华大学
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY2007-1DOI: 10.1007/s00170-005-0277-5
93被引14阅读
引用收藏
分享

摘要

The no-wait flow shop scheduling that requires jobs to be processed without interruption between consecutive machines is a typical NP-hard combinatorial optimization problem, and represents an important area in production scheduling. This paper proposes an effective hybrid algorithm based on particle swarm optimization (PSO) for no-wait flow shop scheduling with the criterion to minimize the maximum completion time (makespan). In the algorithm, a novel encoding scheme based on random key representation is developed, and an efficient population initialization, an effective local search based on the Nawaz-Enscore-Ham (NEH) heuristic, as well as a local search based on simulated annealing (SA) with an adaptive meta-Lamarckian learning strategy are proposed and incorporated into PSO. Simulation results based on well-known benchmarks and comparisons with some existing algorithms demonstrate the effectiveness of the proposed hybrid algorithm.

学科与关键词

关键词
flow shop schedulingno-waitmakespanparticle swarm optimizationsimulated annealinglocal search
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
发表日期
2007-01
卷期
第 31 卷, 第 9-10 期
页码
1001-1011
DOI
10.1007/s00170-005-0277-5
语言
ENGLISH
成果收录
SCIE

作者

  • L

    Liu, Bo (通讯) (第一作者)

    tsinghua univ

  • W

    Wang, Ling

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

    Jin, Yi-Hui

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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