A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule

DOI10.1007/s10951-009-0159-zzbMath1213.90125MaRDI QIDQ633540

Alix Munier Kordon

Publication date: 1 April 2011

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-009-0159-z

zbMATH Keywords

cyclic schedule; earliest start schedule; minimum average cycle time; periodic schedule

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Converging to periodic schedules for cyclic scheduling problems with resources and deadlines, The impact of core precedences in a cyclic RCPSP with precedence delays, Steady state analysis of timed event graphs with time window constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A parametric critical path problem and an application for cyclic scheduling
• On a graph-theoretical model for cyclic register allocation
• Determining the optimal starting times in a cyclic schedule with a given route
• Some complexity results in cyclic scheduling
• A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
• A study of the cyclic scheduling problem on parallel processors
• On scheduling cycle shops: Classification, complexity and approximation
• The complexity of cyclic shop scheduling problems
• A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints
• Performance evaluation of job-shop systems using timed event-graphs