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

Local search methods for the flowshop scheduling problem with flowtime minimization

Pan, Quan-Ke; Ruiz, Ruben*东北大学
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH2012-10-1DOI: 10.1016/j.ejor.2012.04.034
100被引6阅读
引用收藏
分享

摘要

Flowshop scheduling is a very active research area. This problem still attracts a considerable amount of interest despite the sheer amount of available results. Total flowtime minimization of a flowshop has been actively studied and many effective algorithms have been proposed in the last few years. New best solutions have been found for common benchmarks at a rapid pace. However, these improvements many times come at the cost of sophisticated algorithms. Complex methods hinder potential applications and are difficult to extend to small problem variations. Replicability of results is also a challenge. In this paper, we examine simple and easy to implement methods that at the same time result in state-of-the-art performance. The first two proposed methods are based on the well known Iterated Local Search (ILS) and Iterated Greedy (IG) frameworks, which have been applied with great success to other flowshop problems. Additionally, we present extensions of these methods that work over populations, something that we refer to as population-based ILS (pILS) and population-based IG (pIGA), respectively. We calibrate the presented algorithms by means of the Design of Experiments (DOE) approach. Extensive comparative evaluations are carried out against the most recent techniques for the considered problem in the literature. The results of a comprehensive computational and statistical analysis show that the presented algorithms are very effective. Furthermore, we show that, despite their simplicity, the presented methods are able to improve 12 out of 120 best known solutions of Taillard's flowshop benchmark with total flowtime criterion.

学科与关键词

关键词
SchedulingFlowshopFlowtimeLocal searchMetaheuristics
相关
加载中…
  • A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
    Ruiz, Ruben*; Stutzle, ThomasEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177(3): 2033-2049.被引 812
  • A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows
    Missaoui, Ahmed; Ruiz, Ruben*EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 303(1): 99-113.被引 31
  • Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues
    Juan, Angel A.*; Lourenco, Helena R.; Mateo, Manuel; Luo, Rachel; Castella, QuimInternational Transactions in Operational Research, 2014, 21(1): 103-126.被引 56
查看全部 →

发表信息

论文状态
公开发表
期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
发表日期
2012-10-01
卷期
第 222 卷, 第 1 期
页码
31-43
DOI
10.1016/j.ejor.2012.04.034
语言
ENGLISH
成果收录
SCIE
资助标注
National Science Foundation of China [61174187, 60874075]; Basic scientific research foundation of Northeast University [N110208001]; Science Foundation of Shandong Province, China [BS2010DX005]; Spanish Ministry of Science and Innovation under the project "SMPA - Advanced Parallel Multiobjective Sequencing: Practical and Theoretical Advances" [DPI2008-03511/DPI]; Small and Medium Industry of the Generalitat Valenciana (IMPIVA); European Union through the European Regional Development Fund (FEDER); Programa de I D para Institutos Tecnologicos de la Red IMPIVA" [IMDEEA/2011/142]

作者

  • P

    Pan, Quan-Ke (第一作者)

    liaocheng univ · northeastern univ

  • R

    Ruiz, Ruben (通讯)

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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