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

A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem

Ahmadizar, Fardin*; Barzinpour, Farnaz
INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS2010-12
10被引7阅读
引用收藏
分享

摘要

This paper deals with the permutation flow shop scheduling problem. The objective is to minimize the maximum completion time, or makespan. To solve this problem which has been proved to be strongly NP-hard, a combination between an ant colony algorithm, a heuristic algorithm and a local search procedure is proposed and presented. The hybrid approach is to use artificial ants to construct solutions by applying a stochastic greedy rule based on the Gupta's heuristic and pheromone trails. A local search is then performed to improve the performance quality of constructed solutions. Once all ants have terminated their generations, the pheromone trails are modified according to a global updating rule. The proposed algorithm is applied to benchmark problems taken from the literature and compared with other metaheuristics. Computational experiments are given to demonstrate the superiority of the algorithm in the quality of solution and CPU time.

学科与关键词

关键词
Permutation flow shopMakespanAnt colony optimizationGupta's heuristicLocal search
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS
发表日期
2010-12
卷期
第 3 卷, 第 6 期
页码
853-861
成果收录
SCIE

作者

  • A

    Ahmadizar, Fardin (通讯) (第一作者)

  • B

    Barzinpour, Farnaz

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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