Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization

DOI10.1007/978-3-540-85097-7_41zbMath1168.90432OpenAlexW1574463447MaRDI QIDQ5505681

Karine Deschinkel, Sid-Ahmed-Ali Touati

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_41

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling

Cites Work

• A study of the cyclic scheduling problem on parallel processors
• OPTIMAL SOFTWARE PIPELINING UNDER RESOURCE CONSTRAINTS
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization