Steady state analysis of timed event graphs with time window constraints
From MaRDI portal
Publication:2440115
DOI10.1016/j.dam.2013.12.006zbMath1284.93156WikidataQ58199719 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
Related Items
Critical subsystems in time interval models. Application to a baking process, The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory
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