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

Minimizing the maximum tardiness for a permutation flow shop problem under the constraint of sequence independent setup time

Elissaouy, Oualid*; Allali, Karam
RAIRO-OPERATIONS RESEARCH2024-2-8DOI: 10.1051/ro/2024001
1被引4阅读
引用收藏
分享

摘要

In this work, we will study a permutation flow shop scheduling problem under the constraint of sequence independent setup time. In our case, each machine requires a certain setup time to process all the different jobs assigned to it. Hence, this setup time will be independent of sequence of jobs, but will depend only on the nature of machine. The optimization objective is to minimize the maximum tardiness criterion. To solve this optimization problem, an exact method, heuristics and metaheuristics are the three main resolution methods that we have used. The exact method is represented by the mixed integer linear programming (MILP) model. In terms of the second category of resolution methods, we have been focused on two methods, the first is a modified heuristic based on Johnson rule (HBJR) while the second is based on the Nawaz-Enscore-Ham (NEH) algorithm. Finally, three metaheuristics have been used, namely the iterated local search (ILS) method, the iterated greedy (IG) algorithm and the genetic algorithm (GA). Our numerical results indicate that for the problems with small size instances, the NEH heuristic outperforms HBJR approach, while for relatively large size instances, the developed IG algorithm gives best results than both other metaheuristics ILS and GA.

学科与关键词

关键词
Permutation flow shop schedulingsequence independent setup timemaximum tardinessMILPheuristicsmetaheuristics
相关
加载中…
  • Distributed no-wait flow shop problem with sequence dependent setup time: Optimization of makespan and maximum tardiness
    Allali, Karam*; Aqil, Said; Belabid, JabraneSIMULATION MODELLING PRACTICE AND THEORY, 2022, 116: 102455.被引 28
  • Local search metaheuristic for solving hybrid flow shop problem in slabs and beams manufacturing
    Aqil, Said*; Allali, KaramEXPERT SYSTEMS WITH APPLICATIONS, 2020, 162: 113716.被引 20
  • 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
查看全部 →

发表信息

论文状态
公开发表
期刊
RAIRO-OPERATIONS RESEARCH
发表日期
2024-02-08
卷期
第 58 卷, 第 1 期
页码
373-395
DOI
10.1051/ro/2024001
语言
ENGLISH
成果收录
SCIE

作者

  • E

    Elissaouy, Oualid (通讯) (第一作者)

  • A

    Allali, Karam

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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