Related Experiment Video
Updated: Jun 21, 2025
05:30
Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
531
Scheduling for batch processes based on clustering approximated timed reachability graphs
Jiazhong Zhou1, Dimitri Lefebvre2, Zhiwu Li3
1College of Information Science and Engineering, Huaqiao University, Xiamen 361021, China; School of Electro-Mechanical Engineering, Xidian University, Xi'an 710071, China.
ISA Transactions
|July 13, 2024
Summary
This study enhances timed extended reachability graphs (TERGs) for batch process scheduling. The improved approach makes complex scheduling problems tractable for large systems using timed Petri nets.
Area of Science:
- Operations Research
- Computer Science
- Chemical Engineering
Background:
- Batch process scheduling is complex, often modeled using timed Petri nets.
- Timed extended reachability graphs (TERGs) aid in finding optimal schedules but suffer from state-space explosion for large systems.
Purpose of the Study:
- To improve existing TERG clustering approaches for large-scale batch process scheduling.
- To develop a systematic method for modeling batch processes with timed Petri nets.
Main Methods:
- Enhancement of the clustering TERG approach for scalability.
- Systematic modeling of batch processes using timed Petri nets.
- Exploration of feasible trajectories within TERGs to determine optimal schedules.
Main Results:
- The proposed enhanced TERG approach effectively handles large-sized batch processes.
- Demonstrated tractability for complex scheduling problems previously intractable.
- Successful application to an archetypal chemical production plant scheduling problem.
Conclusions:
- The enhanced TERG clustering method offers an efficient solution for large-scale batch process scheduling.
- The systematic modeling approach facilitates the application of timed Petri nets to industrial problems.
- The study provides a validated methodology for optimizing batch process makespans.
