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

A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks

Tseng, Chao-Tang; Liao, Ching-Jong*
International Journal of Production Research2008DOI: 10.1080/00207540701294627
89被引3阅读
引用收藏
分享

摘要

The multistage hybrid flow-shop scheduling problem with multiprocessor tasks has been found in many practical situations. Due to the essential complexity of the problem, many researchers started to apply metaheuristics to solve the problem. In this paper, we address the problem by using particle swarm optimization (PSO), a novel metaheuristic inspired by the flocking behaviour of birds. The proposed PSO algorithm has several features, such as a new encoding scheme, an implementation of the best velocity equation and neighbourhood topology among several different variants, and an effective incorporation of local search. To verify the PSO algorithm, computational experiments are conducted to make a comparison with two existing genetic algorithms (GAs) and an ant colony system (ACS) algorithm based on the same benchmark problems. The results show that the proposed PSO algorithm outperforms all the existing algorithms for the considered problem.

学科与关键词

关键词
schedulinghybrid flow-shopmultiprocessor tasksparticle swarm optimization
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
International Journal of Production Research
发表日期
2008
卷期
第 46 卷, 第 17 期
页码
4655-4670
DOI
10.1080/00207540701294627
语言
MULTI-LANGUAGE
成果收录
SCIE

作者

  • T

    Tseng, Chao-Tang (第一作者)

  • L

    Liao, Ching-Jong (通讯)

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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