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

Local search metaheuristic for solving hybrid flow shop problem in slabs and beams manufacturing

Aqil, Said*; Allali, Karam
EXPERT SYSTEMS WITH APPLICATIONS2020-12-30DOI: 10.1016/j.eswa.2020.113716
20被引2阅读
引用收藏
分享

摘要

Solving optimization problems in the modern manufacturing industry is one of the most attractive areas of operational research. In this paper, we propose an industrial optimization case of slabs and beams production problem. The suggested approach consists in modeling the process as a hybrid flow shop with unrelated parallel machines under constraints of sequence dependent setup time. Jobs launched in production are of different characteristics and require a machine preparation time at each phase during their production cycle. The goal is to minimize the total tardiness of all jobs when they are completed on the last stage. The hybrid flow shop problem is considered as one of the NP-hard issues since it consists of at least two stages. To solve numerically this problem, we propose two methods, the iterative local search (ILS) and the iterated greedy (IG) metaheuristics. In addition, we suggest two new improvements, the first relates to the initial step while the second concerns the steps of the neighborhood exploration. In the initial phase, we consider an initial solution set generated from the priority rules whose scheduling is ensured by the Nawaz-Enscore-Ham (NEH) algorithm and the greedy randomized adaptive search procedure (GRASP). In the second phase, we suggest a new version of exploration of the neighborhood. In fact, from a single solution, we will generate a set of neighboring solutions and we will choose the best solution. In this new resolution approach, we develop a total of twelve algorithms based on neighborhood exploration. We note that the proposed algorithms are hybrid metaheuristics and are among the most powerful optimization algorithms in local search. A simulation study is conducted to verify the effectiveness of the suggested algorithms.This simulation is performed on a set of instances by varying the number of jobs, the number of machines per stage and the number of stages. We find that the IG algorithm based on NEH initialization heuristic gives good results in terms of quality and convergence time to the best solution.

学科与关键词

关键词
Hybrid flow shopUnrelated parallel machinesSequence dependent setup timeTotal tardinessIterative local searchIterative greedy algorithm
相关
加载中…
  • 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
  • Two efficient nature inspired meta-heuristics solving blocking hybrid flow shop manufacturing problem
    Aqil, Said*; Allali, KaramENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2021, 100.被引 31
  • Minimizing the maximum tardiness for a permutation flow shop problem under the constraint of sequence independent setup time
    Elissaouy, Oualid*; Allali, KaramRAIRO-OPERATIONS RESEARCH, 2024, 58(1): 373-395.被引 1
查看全部 →

发表信息

论文状态
公开发表
期刊
EXPERT SYSTEMS WITH APPLICATIONS
发表日期
2020-12-30
卷期
第 162 卷
页码
113716
DOI
10.1016/j.eswa.2020.113716
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
1区
成果收录
SCIE

作者

  • A

    Aqil, Said (通讯) (第一作者)

  • A

    Allali, Karam

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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