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

A discrete differential evolution algorithm for the permutation flowshop scheduling problem

Pan, Quan-Ke; Tasgetiren, Mehmet Fatih*; Liang, Yun-Chialiaocheng univ
COMPUTERS & INDUSTRIAL ENGINEERING2008-11DOI: 10.1016/j.cie.2008.03.003
231被引2阅读
引用收藏
分享

摘要

Very recently, Pan et al. [Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECC007, pp. 126-33] presented a new and novel discrete differential evolution algorithm for the permutation flowshop scheduling problem with the makespan criterion. On the other hand, the iterated greedy algorithm is proposed by [Ruiz, R.. & Stutzle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177(3), 2033-49] for the permutation flowshop scheduling problem with the makespan criterion. However, both algorithms are not applied to the permutation flowshop scheduling problem with the total flowtime criterion. Based on their excellent performance with the makespan criterion, we extend both algorithms in this paper to the total flowtime objective. Furthermore, we propose a new and novel referenced local search procedure hybridized with both algorithms to further improve the solution quality. The referenced local search exploits the space based on reference positions taken from a reference solution in the hope of finding better positions for jobs when performing insertion operation. Computational results show that both algorithms with the referenced local search are either better or highly competitive to all the existing approaches in the literature for both objectives of makespan and total flowtime. Especially for the total flowtime criterion, their performance is superior to the particle swarm optimization algorithms proposed by [Tasgetiren, M. F., Liang, Y. -C., Sevkli, M., Gencyilmaz, G. (2007). Particle swarm optimization algorithm for makespan and total flowtime minimization in permutation flowshop sequencing problem. European journal of Operational Research, 177(3), 1930-47] and [Jarboui, B., Ibrahim, S., Siarry, P., Rebai, A. (2007). A combinatorial particle swarm optimisation for solving permutation flowshop problems. Computers & Industrial Engineering, doi: 10.1016/j.cie.2007.09.006]. Ultimately, for Taillard's benchmark suite, four best known solutions for the makespan criterion as well as 40 out of the 90 best known solutions for the total flowtime criterion are further improved by either one of the algorithms presented in this paper.

学科与关键词

关键词
Permutation flowshop SchedulingIterated greedy algorithmDiscrete differential evolution algorithmDiscrete particle swarm optimizationReferenced local search
相关
加载中…
  • An effective differential evolution algorithm for permutation flow shop scheduling problem
    Liu, Ying; Yin, Minghao*; Gu, WenxiangAPPLIED MATHEMATICS AND COMPUTATION, 2014, 248: 143-159.被引 39
  • A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
    Pan, Quan-Ke; Wang, Ling*; Qian, BinCOMPUTERS & OPERATIONS RESEARCH, 2009, 36(8): 2498-2511.被引 160
  • An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure
    Li, Xiangtao; Yin, Minghao*ADVANCES IN ENGINEERING SOFTWARE, 2013, 55: 10-31.被引 126
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPUTERS & INDUSTRIAL ENGINEERING
发表日期
2008-11
卷期
第 55 卷, 第 4 期
页码
795-816
DOI
10.1016/j.cie.2008.03.003
语言
MULTI-LANGUAGE
成果收录
SCIE

作者

  • P

    Pan, Quan-Ke (第一作者)

    liaocheng univ

  • T

    Tasgetiren, Mehmet Fatih (通讯)

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

    Liang, Yun-Chia

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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