How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations

DOI10.1051/RO/2013036zbMATH Open1311.68038OpenAlexW1998911098MaRDI QIDQ5397696FDOQ5397696

Authors: Sid-Ahmed-Ali Touati, Sébastien Briais, Karine Deschinkel 

Publication date: 24 February 2014

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2013__47_3_223_0/

Recommendations

• Periodic schedules for linear precedence constraints
• A note on periodic schedules for linear precedence constraints
• Scheduling expression DAGs for minimal register need
• scientific article; zbMATH DE number 2084744
• Converging to periodic schedules for cyclic scheduling problems with resources and deadlines

zbMATH Keywords

linear programmingperiodic schedulingstorage constraintscode optimisationregister constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

This page was built for publication: How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5397696)