Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

The Availability Heuristic01:08

The Availability Heuristic

5.9K
A heuristic is a general problem-solving framework (Tversky & Kahneman, 1974). You can think of these as mental shortcuts that are used to solve problems. Different types of heuristics are used in different types of situations, and the impulse to use a heuristic occurs when one of five conditions is met (Pratkanis, 1989):
5.9K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Pilot-scale treatment of wool scouring wastewater in two-stage anoxic/oxic moving bed biofilm reactor: Performance and nitrogen removal mechanism.

Bioresource technology·2026
Same author

Analytical inverse kinematics solution and global arm angle optimization method for 7-DOF redundant robotic arms without offset.

ISA transactions·2026
Same author

A dataset and benchmark of carbonate thin-section images for deep learning.

Scientific data·2026
Same author

WCD-YOLO: A waste classification detection model.

Journal of environmental management·2026
Same author

Layout Optimization of the Six-Axis Industrial Robot Based on an Improved Whale Algorithm for Reducing Energy Consumption in Industry 5.0.

Exploration (Beijing, China)·2026
Same author

Organic material application holds great potential for alleviating soil nitrogen loss from cropland caused by shallow groundwater table fluctuations but increases N<sub>2</sub>O emissions.

Water research·2026

Related Experiment Video

Updated: Jun 21, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
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
PubMed
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.

Keywords:
Batch processClustering algorithmReachability graphSchedulingTimed Petri net

More Related Videos

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

8.2K
ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

11.4K

Related Experiment Videos

Last Updated: Jun 21, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

531
Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

8.2K
ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

11.4K

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.