Transferring progress control policies in scheduling problems for a class of repetitive discrete event systems

DOI10.1080/00207170903177782zbMath1184.93054OpenAlexW2028449847MaRDI QIDQ3550804

Hirotaka Takahashi, Hiroyuki Goto

Publication date: 6 April 2010

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207170903177782

zbMATH Keywords

adjacency matrixdioid algebradirected acyclic graphstate-space representationheap modelprogress control

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Design techniques (robust design, computer-aided design, etc.) (93B51) Discrete event control/observation systems (93C65) Discrete version of topics in analysis (39A12)

Cites Work

• Unnamed Item
• Linear periodic systems over dioids
• A first step towards adaptive control for linear systems in max algebra
• Dual representation and its online scheduling method for event-varying DESs with capacity constraints
• Modeling and analysis of timed Petri nets using heaps of pieces
• Model predictive control for max-plus-linear discrete event systems
• Model reference control for timed event graphs in diods
• Asymptotic behavior in a heap model with two pieces

This page was built for publication: Transferring progress control policies in scheduling problems for a class of repetitive discrete event systems