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

Constraint programming models for the hybrid flow shop scheduling problem and its extensions

Isik, Eyup Ensar; Yildiz, Seyda Topaloglu*; Akpunar, Ozge Satir
SOFT COMPUTING2023-12DOI: 10.1007/s00500-023-09086-9
3被引7阅读
引用收藏
分享

摘要

Proper scheduling of jobs is essential for modern production systems to work effectively. The hybrid flow shop scheduling problem is a scheduling problem with many applications in the industry. The problem has also attracted much attention from researchers due to its complexity. This study addresses the hybrid flow shop scheduling problem (HFSP), which considers unrelated parallel machines at each stage and the machine eligibility constraints. HFSP is a well-known NP-hard problem with the aim of minimizing the makespan. Owing to the complexity of the problem, this study develops constraint programming (CP) models for the HFSP and its extensions: the no-wait HFSP, the blocking HFSP, the HFSP with sequence-dependent setup times, the no-wait HFSP with sequence-dependent setup times, and the blocking HFSP with sequence-dependent setup times. We also propose two mixed-integer linear programming models (MILP) for no-wait and blocking HSFPs with sequence-dependent setup times. The performances of the CP models were tested against their MILP counterparts using randomly generated instances and benchmark instances from the literature. The computational results indicated that the proposed CP model outperformed the best MILP solutions for benchmark instances. It is also more effective for finding high-quality solutions for larger problem instances.

学科与关键词

关键词
Hybrid flow shop schedulingConstraint programmingMixed-integer linear programmingSequence-dependent setup timeBlockingNo-wait
相关
加载中…
  • Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem
    Meng, Leilei; Zhang, Chaoyong*; Ren, Yaping; Zhang, Biao; Lv, ChangCOMPUTERS & INDUSTRIAL ENGINEERING, 2020, 142: 106347.被引 178
  • Constraint programming approach for multi-resource-constrained unrelated parallel machine scheduling problem with sequence-dependent setup times
    Yunusoglu, Pinar; Yildiz, Seyda Topaloglu*International Journal of Production Research, 2022, 60(7): 2212-2229.被引 47
  • Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming
    Gogos, Christos*Applied Sciences-Basel, 2023, 13(23): 12562.被引 2
查看全部 →

发表信息

论文状态
公开发表
期刊
SOFT COMPUTING
发表日期
2023-12
卷期
第 27 卷, 第 24 期
页码
18623-18650
DOI
10.1007/s00500-023-09086-9
语言
ENGLISH
成果收录
SCIE

作者

  • I

    Isik, Eyup Ensar (第一作者)

  • Y

    Yildiz, Seyda Topaloglu (通讯)

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

    Akpunar, Ozge Satir

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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