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 条
[21]   Integrated Scheduling and Dynamic Optimization for Network Batch Processes [J].
Chu, Yunfei ;
You, Fengqi .
24TH EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING, PTS A AND B, 2014, 33 :523-528
[22]   Heuristic Scheduling of Batch Production Processes Based on Petri Nets and Iterated Greedy Algorithms [J].
Zhao, Ziyan ;
Liu, Shixin ;
Zhou, Mengchu ;
You, Dan ;
Guo, Xiwang .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2022, 19 (01) :251-261
[23]   Heat integration for batch processes - Part 1: Process scheduling based on cascade analysis [J].
Zhao, XG ;
O'Neill, BK ;
Roach, JR ;
Wood, RM .
CHEMICAL ENGINEERING RESEARCH & DESIGN, 1998, 76 (A6) :685-699
[24]   Relevant Timed Schedules/Clock Vectors for Constructing Time Petri Net Reachability Graphs [J].
Boucheneb, Hanifa ;
Barkaoui, Kamel .
DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2011, 21 (02) :171-204
[25]   Scheduling of batch processes with operational uncertainties [J].
Orcun, S ;
Altinel, IK ;
Hortacsu, O .
COMPUTERS & CHEMICAL ENGINEERING, 1996, 20 :S1191-S1196
[26]   Relevant Timed Schedules/Clock Vectors for Constructing Time Petri Net Reachability Graphs [J].
Hanifa Boucheneb ;
Kamel Barkaoui .
Discrete Event Dynamic Systems, 2011, 21 :171-204
[27]   FMS Scheduling under Availability Constraint with Supervisor Based on Timed Petri Nets [J].
Kammoun, Mohamed Ali ;
Ezzeddine, Wajih ;
Rezg, Nidhal ;
Achour, Zied .
APPLIED SCIENCES-BASEL, 2017, 7 (04)
[28]   Batch Scheduling With Intermediate Due Dates Using Timed Automata Models [J].
Subbiah, Subanatarajan ;
Tometzki, Thomas ;
Engell, Sebastian .
18TH EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING, 2008, 25 :151-156
[29]   AN INTEGRATED HYBRID PETRI NET AND GA BASED APPROACH FOR SCHEDULING OF MIXED BATCH/CONTINUOUS PROCESSES [J].
Liao Wei-Zhi ;
Li Wen-Jing .
2012 11TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND APPLICATIONS TO BUSINESS, ENGINEERING & SCIENCE (DCABES), 2012, :268-272
[30]   New completion time algorithms for sequence based scheduling in multiproduct batch processes using matrix [J].
Shafeeq, Amir ;
Mutalib, M. I. Abdul ;
Amminudin, K. A. ;
Muhammad, Ayyaz .
CHEMICAL ENGINEERING RESEARCH & DESIGN, 2008, 86 (10A) :1167-1181
12345