Scheduling for batch processes based on clustering approximated timed reachability graphs

被引：0

作者：

Zhou, Jiazhong ^{[1
,2
]}

Lefebvre, Dimitri ^{[3
]}

Li, Zhiwu ^{[2
,4
]}

机构：

[1] Huaqiao Univ, Coll Informat Sci & Engn, Xiamen 361021, Peoples R China

[2] Xidian Univ, Sch Electromech Engn, Xian 710071, Peoples R China

[3] Univ La Havre Normandie, Normandie Univ, GREAH UR 3220, F-76600 Le Havre, France

[4] Macau Univ Sci & Technol, Inst Syst Engn, Macau, Peoples R China

来源：

ISA TRANSACTIONS | 2024年 / 152卷

基金：

中国国家自然科学基金;

关键词：

Batch process; Timed Petri net; Reachability graph; Clustering algorithm; Scheduling; FLEXIBLE MANUFACTURING SYSTEMS; HEURISTIC HYBRID SEARCH; PETRI NETS; MODEL CHECKING; STATE-SPACE; ALGORITHM; OPTIMIZATION;

D O I：

10.1016/j.isatra.2024.06.028

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：290 / 298

页数：9

共 50 条

[31] Multiple dynamic kernel clustering based online monitoring for batch processes
Wang, Yajun
Sun, Fuming
[J]. Huagong Xuebao/CIESC Journal, 2014, 65 (12): : 4905 - 4913
[32] Dynamic hybrid simulation of batch processes driven by a scheduling module
Fabre, Florian
Hetreux, Gilles
Le Lann, Jean-Marc
Zarate, Pascale
[J]. COMPUTERS & CHEMICAL ENGINEERING, 2011, 35 (10) : 2098 - 2112
[33] Stochastic Scheduling for Batch Processes With Downstream Queue Time Constraints
Chien, Wen-Chi
Chou, Ywh-Leh
Wu, Cheng-Hung
[J]. IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, 2023, 36 (04) : 599 - 610
[34] Timed Automata Models for Batch Scheduling with Sequence-Dependent Changeovers
Subbiah, Subanatarajan
Engell, Sebastian
[J]. 10TH INTERNATIONAL SYMPOSIUM ON PROCESS SYSTEMS ENGINEERING, 2009, 27 : 1515 - 1520
[35] Timed Petri net based scheduling for mechanical assembly - Integration of planning and scheduling
Inaba, A
Fujiwara, F
Suzuki, T
Okuma, S
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1998, E81A (04) : 615 - 625
[36] Revisiting Bounded Reachability Analysis of Timed Automata Based on MILP
Ober, Iulian
[J]. FORMAL METHODS FOR INDUSTRIAL CRITICAL SYSTEMS, FMICS 2018, 2018, 11119 : 269 - 283
[37] Scheduling approach for mixed networked batch processes
Soltan, HAM
[J]. CURRENT ADVANCES IN MECHANICAL DESIGN AND PRODUCTION VII, 2000, : 603 - 610
[38] General reordering algorithm for scheduling of batch processes
[J]. Hasebe, Shinji, 1600, (24):
[39] Modeling and Optimization for Scheduling of Chemical Batch Processes
Qian Yu
Pan Ming
Huang Yacai
[J]. CHINESE JOURNAL OF CHEMICAL ENGINEERING, 2009, 17 (01) : 1 - 7
[40] Multi-product batch scheduling with intermediate due dates using priced timed automata models
Subbiah, Subanatarajan
Tometzki, Thomas
Panek, Sebastian
Engell, Sebastian
[J]. COMPUTERS & CHEMICAL ENGINEERING, 2009, 33 (10) : 1661 - 1676

← 1 2 3 4 5 →