The resource-constrained modulo scheduling problem: an experimental study
DOI10.1007/s10589-012-9499-2zbMath1267.90046OpenAlexW1997840956MaRDI QIDQ2377171
Claire Hanen, Christian Artigues, Abir Benabid, Maria Ayala
Publication date: 28 June 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9499-2
integer linear programminghybrid methodresource constraintsmodulo schedulingdecomposed software pipeliningVLIW parallel processors
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (4)
Cites Work
- A cyclic scheduling problem with an undetermined number of parallel identical processors
- Retiming synchronous circuitry
- An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
- A study of the cyclic scheduling problem on parallel processors
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays
- Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
- Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors
- Precedence Constraint Posting for Cyclic Scheduling Problems
This page was built for publication: The resource-constrained modulo scheduling problem: an experimental study