FMS scheduling based on timed Petri net model and reactive graph search
type: Item
instance of: scholarly article
title: FMS scheduling based on timed Petri net model and reactive graph search
zbMATH Open document ID: 1144.90383
author: Tatsuya Suzuki
author: Tatsuo Narikiyo
author: Young-Woo Kim
published in: Applied Mathematical Modelling
publication date: 2008-08-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5312874
zbMATH Keywords: model based scheduling
zbMATH Keywords: timed Petri net
zbMATH Keywords: RTA\(^{*}\)
zbMATH Keywords: supervisor
zbMATH Keywords: due date problem
MaRDI profile type: Publication
full work available at URL: j.apm.2006.10.023
OpenAlex ID: W2039104801
cites work: A genetic algorithm for the job shop problem
cites work: Minimizing flow time variance in a single machine system using genetic algorithms
cites work: Design for agile assembly: An operational perspective
cites work: Applying tabu search to the job-shop scheduling problem
cites work: Tabu search for resource-constrained scheduling
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: A Dynamic Programming Approach to Sequencing Problems
cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
cites work: Job-Shop Scheduling by Implicit Enumeration
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: One machine scheduling problem with fuzzy duedates
cites work: Real-time heuristic search
cites work: Q4348471
cites work: Q4332699
cites work: Supervisory Control of a Class of Discrete Event Processes
DOI: 10.1016/J.APM.2006.10.023
description: scientific article; zbMATH DE number 5312874