FMS scheduling based on timed Petri net model and reactive graph search

DOI10.1016/j.apm.2006.10.023zbMath1144.90383MaRDI QIDQ937986

Tatsuya Suzuki, Tatsuo Narikiyo, Young-Woo Kim

Publication date: 18 August 2008

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2006.10.023

zbMATH Keywords

timed Petri net; supervisor; due date problem; model based scheduling; RTA\(^{*}\)

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Modeling job shop scheduling with batches and setup times by timed Petri nets, Scheduling manufacturing systems with blocking: a Petri net approach

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing flow time variance in a single machine system using genetic algorithms
• One machine scheduling problem with fuzzy duedates
• A genetic algorithm for the job shop problem
• Tabu search for resource-constrained scheduling
• Applying tabu search to the job-shop scheduling problem
• Real-time heuristic search
• A Dynamic Programming Approach to Sequencing Problems
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Supervisory Control of a Class of Discrete Event Processes
• An Algorithm for Solving the Job-Shop Problem
• Job-Shop Scheduling by Implicit Enumeration
• Design for agile assembly: An operational perspective
• A Fast Taboo Search Algorithm for the Job Shop Problem