The resource-constrained modulo scheduling problem: an experimental study

DOI10.1007/s10589-012-9499-2zbMath1267.90046MaRDI 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

zbMATH Keywords

integer linear programming; hybrid method; resource constraints; modulo scheduling; decomposed software pipelining; VLIW parallel processors

Mathematics Subject Classification ID

90C10: Integer programming

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

A robust basic cyclic scheduling problem, Optimizing energy consumption of robotic cells by a branch \& bound algorithm, Debugging unsatisfiable constraint models, The impact of core precedences in a cyclic RCPSP with precedence delays

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