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

Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming

Gogos, Christos*
Applied Sciences-Basel2023-12DOI: 10.3390/app132312562
2被引1阅读
引用收藏
分享

摘要

The permutation flow-shop scheduling problem is a classical problem in scheduling that aims at identifying the optimal sequence of jobs that should be processed in a number of machines in an effort to minimize makespan or some other performance criterion. The distributed permutation flow-shop scheduling problem adds multiple factories where copies of the machines exist and asks for minimizing the makespan on the longest-running location. In this paper, the problem is approached using Constraint Programming and its specialized scheduling features, such as interval variables and non-overlap constraints, while a novel heuristic is proposed for computing lower bounds. Two constraint programming models are proposed: one that solves the Distributed Permutation Flow-shop Scheduling problem, and another one that drops the constraint of processing jobs under the same order for all machines of each factory. The experiments use an extended public dataset of problem instances to validate the approach's effectiveness. In the process, optimality is proved for many problem instances known in the literature but has yet to be proven optimal. Moreover, a high speed of reaching optimal solutions is achieved for many problems, even with moderate big sizes (e.g., seven factories, 20 machines, and 20 jobs). The critical role that the number of jobs plays in the complexity of the problem is identified and discussed. In conclusion, this paper demonstrates the great benefits of scheduling problems that stem from using state-of-the-art constraint programming solvers and models that capture the problem tightly.

学科与关键词

关键词
schedulingconstraint programmingheuristicslower boundsdistributed permutation flow-shop scheduling problemdistributed flow-shop scheduling problembenchmark dataset
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
Applied Sciences-Basel
发表日期
2023-12
卷期
第 13 卷, 第 23 期
页码
12562
DOI
10.3390/app132312562
语言
ENGLISH
成果收录
SCIE

作者

  • G

    Gogos, Christos (通讯) (第一作者)

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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