Petri net based scheduling

DOI10.1007/BF01540160zbMath0865.90077OpenAlexW2129855961MaRDI QIDQ2564338

Wil M. P. van der Aalst

Publication date: 6 July 1997

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01540160

zbMATH Keywords

makespantimed Petri netsconflicting and redundant precedences

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35)

Related Items

Revising history for cost-informed process improvement ⋮ Modeling job shop scheduling with batches and setup times by timed Petri nets ⋮ Production scheduling with alternative process plans ⋮ An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets

Uses Software

• ExSpect
• INA

Cites Work

• A survey of priority rule-based scheduling
• Performance evaluation of job-shop systems using timed event-graphs
• An Algorithm for Solving the Job-Shop Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Petri net based scheduling