Enhancing industrial scheduling through machine learning: A synergistic approach with predictive modeling and clustering

IF 3.9 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Maria E. Samouilidou, Nikolaos Passalis, Georgios P. Georgiadis, Michael C. Georgiadis
{"title":"Enhancing industrial scheduling through machine learning: A synergistic approach with predictive modeling and clustering","authors":"Maria E. Samouilidou,&nbsp;Nikolaos Passalis,&nbsp;Georgios P. Georgiadis,&nbsp;Michael C. Georgiadis","doi":"10.1016/j.compchemeng.2025.109174","DOIUrl":null,"url":null,"abstract":"<div><div>In this study, a novel solution framework is developed integrating Machine Learning (ML) techniques with Mixed-Integer Linear Programming (MILP) to address the optimization of production scheduling in manufacturing industries characterized by multiple products, shared resources and parallel production lines. The dynamic nature of these industries often requires rapid schedule adjustments within minutes to address unexpected events. At the same time, manufacturing facilities face frequent changeover operations to prevent cross-contamination. Inefficient product allocation to packing lines often leads to significant downtime and material waste, especially when introducing new products with unrecorded changeover times. To overcome these challenges, the proposed framework first compiles a representation space in which distances correspond to changeover times. This enables the employment of constrained clustering to group production orders according to the available packing lines, minimizing changeover times within each cluster. Then, the derived allocation is used to restrict the solution space of an MILP-based scheduling model to reduce its computational complexity. Furthermore, to tackle the issue of unavailable changeover data, a predictive ML model is trained to predict unknown changeover times for new or existing products. An evaluation study based on a construction materials plant is conducted to test the applicability of the framework. It is concluded that the proposed approach achieves accurate solutions rapidly, reduces downtime and facilitates the smooth integration of new products into the production process. In addition, it is applicable to a wide range of industries, and it enables the extension to an online scheduling framework due to its computational speed.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"200 ","pages":"Article 109174"},"PeriodicalIF":3.9000,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Chemical Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0098135425001784","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In this study, a novel solution framework is developed integrating Machine Learning (ML) techniques with Mixed-Integer Linear Programming (MILP) to address the optimization of production scheduling in manufacturing industries characterized by multiple products, shared resources and parallel production lines. The dynamic nature of these industries often requires rapid schedule adjustments within minutes to address unexpected events. At the same time, manufacturing facilities face frequent changeover operations to prevent cross-contamination. Inefficient product allocation to packing lines often leads to significant downtime and material waste, especially when introducing new products with unrecorded changeover times. To overcome these challenges, the proposed framework first compiles a representation space in which distances correspond to changeover times. This enables the employment of constrained clustering to group production orders according to the available packing lines, minimizing changeover times within each cluster. Then, the derived allocation is used to restrict the solution space of an MILP-based scheduling model to reduce its computational complexity. Furthermore, to tackle the issue of unavailable changeover data, a predictive ML model is trained to predict unknown changeover times for new or existing products. An evaluation study based on a construction materials plant is conducted to test the applicability of the framework. It is concluded that the proposed approach achieves accurate solutions rapidly, reduces downtime and facilitates the smooth integration of new products into the production process. In addition, it is applicable to a wide range of industries, and it enables the extension to an online scheduling framework due to its computational speed.
通过机器学习增强工业调度:预测建模和聚类的协同方法
本文将机器学习(ML)技术与混合整数线性规划(MILP)相结合,提出了一种新的解决方案框架,以解决多产品、共享资源和并行生产线的制造业生产调度优化问题。这些行业的动态特性通常需要在几分钟内快速调整计划以应对意外事件。同时,为了防止交叉污染,生产设施面临频繁的转换操作。低效率的产品分配到包装线经常导致严重的停机时间和材料浪费,特别是在引入没有记录转换时间的新产品时。为了克服这些挑战,提出的框架首先编译了一个表示空间,其中距离对应于转换时间。这使得使用受限的集群,根据可用的包装线对生产订单进行分组,最大限度地减少每个集群内的转换时间。然后,利用导出的分配来限制基于milp的调度模型的解空间,以降低其计算复杂度。此外,为了解决不可用转换数据的问题,我们训练了一个预测ML模型来预测新产品或现有产品的未知转换时间。以某建筑材料厂为例进行了评价研究,验证了该框架的适用性。结果表明,所提出的方法可以快速获得准确的解决方案,减少停机时间,并有助于将新产品顺利集成到生产过程中。此外,它适用于广泛的行业,并且由于其计算速度快,可以扩展到在线调度框架。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Chemical Engineering
Computers & Chemical Engineering 工程技术-工程:化工
CiteScore
8.70
自引率
14.00%
发文量
374
审稿时长
70 days
期刊介绍: Computers & Chemical Engineering is primarily a journal of record for new developments in the application of computing and systems technology to chemical engineering problems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信