{"title":"基于聚类近似定时可达图的批处理调度。","authors":"","doi":"10.1016/j.isatra.2024.06.028","DOIUrl":null,"url":null,"abstract":"<div><p>To solve some scheduling problems of batch processes based on timed Petri net models, timed extended reachability graphs (TERGs) and approximated TERGs can be used. Such graphs abstract temporal specifications and represent parts of timed languages. By exploring the feasible trajectories in a TERG, optimal schedules can be obtained with respect to the makespans of batch processes that are modeled by timed Petri nets. Nevertheless, the rapid growth of the number of states in a TERG makes the problem intractable for large systems. In this paper, we improve the existing clustering TERG approach, and we make it suitable for large sized batch processes. We also enlarge a systematic approach to model batch processes with timed Petri nets. Finally, a comprehensive example of scheduling problem is studied for an archetypal chemical production plant in order to illustrate the efficiency of the proposed approach.</p></div>","PeriodicalId":14660,"journal":{"name":"ISA transactions","volume":null,"pages":null},"PeriodicalIF":6.3000,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0019057824003161/pdfft?md5=2ee9b4ab42ef5d78e0de55fbd7209ad2&pid=1-s2.0-S0019057824003161-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Scheduling for batch processes based on clustering approximated timed reachability graphs\",\"authors\":\"\",\"doi\":\"10.1016/j.isatra.2024.06.028\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>To solve some scheduling problems of batch processes based on timed Petri net models, timed extended reachability graphs (TERGs) and approximated TERGs can be used. Such graphs abstract temporal specifications and represent parts of timed languages. By exploring the feasible trajectories in a TERG, optimal schedules can be obtained with respect to the makespans of batch processes that are modeled by timed Petri nets. Nevertheless, the rapid growth of the number of states in a TERG makes the problem intractable for large systems. In this paper, we improve the existing clustering TERG approach, and we make it suitable for large sized batch processes. We also enlarge a systematic approach to model batch processes with timed Petri nets. Finally, a comprehensive example of scheduling problem is studied for an archetypal chemical production plant in order to illustrate the efficiency of the proposed approach.</p></div>\",\"PeriodicalId\":14660,\"journal\":{\"name\":\"ISA transactions\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":6.3000,\"publicationDate\":\"2024-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0019057824003161/pdfft?md5=2ee9b4ab42ef5d78e0de55fbd7209ad2&pid=1-s2.0-S0019057824003161-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ISA transactions\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019057824003161\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ISA transactions","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019057824003161","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0
摘要
为了解决一些基于定时 Petri 网模型的批处理调度问题,可以使用定时扩展可达性图(TERG)和近似 TERG。这类图抽象了时间规范,代表了定时语言的一部分。通过探索 TERG 中的可行轨迹,可以获得与定时 Petri 网建模的批处理过程的时间跨度相关的最优时间表。然而,TERG 中状态数量的快速增长使得该问题在大型系统中难以解决。在本文中,我们改进了现有的聚类 TERG 方法,使其适用于大型批处理流程。我们还扩大了用定时 Petri 网为批处理建模的系统方法。最后,我们研究了一个典型化工生产厂的综合调度问题实例,以说明所提方法的效率。
Scheduling for batch processes based on clustering approximated timed reachability graphs
To solve some scheduling problems of batch processes based on timed Petri net models, timed extended reachability graphs (TERGs) and approximated TERGs can be used. Such graphs abstract temporal specifications and represent parts of timed languages. By exploring the feasible trajectories in a TERG, optimal schedules can be obtained with respect to the makespans of batch processes that are modeled by timed Petri nets. Nevertheless, the rapid growth of the number of states in a TERG makes the problem intractable for large systems. In this paper, we improve the existing clustering TERG approach, and we make it suitable for large sized batch processes. We also enlarge a systematic approach to model batch processes with timed Petri nets. Finally, a comprehensive example of scheduling problem is studied for an archetypal chemical production plant in order to illustrate the efficiency of the proposed approach.
期刊介绍:
ISA Transactions serves as a platform for showcasing advancements in measurement and automation, catering to both industrial practitioners and applied researchers. It covers a wide array of topics within measurement, including sensors, signal processing, data analysis, and fault detection, supported by techniques such as artificial intelligence and communication systems. Automation topics encompass control strategies, modelling, system reliability, and maintenance, alongside optimization and human-machine interaction. The journal targets research and development professionals in control systems, process instrumentation, and automation from academia and industry.