Steady state analysis of timed event graphs with time window constraints

DOI10.1016/j.dam.2013.12.006zbMath1284.93156OpenAlexW2096355648WikidataQ58199719 ScholiaQ58199719MaRDI QIDQ2440115

Chihyun Jung, Tae-Eog Lee, Seong-Ho Park

Publication date: 27 March 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.12.006

zbMATH Keywords

event graphsteady state analysisnegative placenegative tokentime window constraint

Mathematics Subject Classification ID

Applications of graph theory (05C90) Discrete event control/observation systems (93C65)

Related Items (2)

The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory ⋮ Critical subsystems in time interval models. Application to a baking process

Cites Work

• Unnamed Item
• A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule
• The basic cyclic scheduling problem with deadlines
• Minimax algebra
• A parametric critical path problem and an application for cyclic scheduling
• A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
• Performance Measures and Schedules in Periodic Job Shops
• An Algebra for Network Routing Problems
• Optimal Cyclic Scheduling Of A Robotic Processing Line With Two-Product And Time-Window Constraints

This page was built for publication: Steady state analysis of timed event graphs with time window constraints