Periodic schedules for linear precedence constraints

DOI10.1016/j.dam.2008.03.018zbMath1155.90383OpenAlexW2027080660MaRDI QIDQ1003670

Claire Hanen, Alix Munier Kordon

Publication date: 4 March 2009

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

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

zbMATH Keywords

complexityalgorithmthroughputcyclic schedulingperiodic schedulelinear precedence

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions ⋮ Critical subsystems in time interval models. Application to a baking process

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some complexity results in cyclic scheduling
• A study of the cyclic scheduling problem on parallel processors
• A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints
• The basic cyclic scheduling problem with linear precedence constraints
• Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
• Performance evaluation of job-shop systems using timed event-graphs
• Termination Properties of Generalized Petri Nets

This page was built for publication: Periodic schedules for linear precedence constraints