The resource-constrained modulo scheduling problem: an experimental study

DOI10.1007/S10589-012-9499-2MaRDI QIDQ2377171zbMATH OpenOpenAlexFDO

Authors Maria Ayala, Abir Benabid, Christian Artigues, Claire Hanen

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

decomposed software pipelininghybrid methodinteger linear programmingmodulo schedulingresource constraintsVLIW parallel processors

Mathematics Subject Classification ID

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

Recommendations

• Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
• Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays
• Optimal software pipelining under resource constraints
• CROSS cyclic resource-constrained scheduling solver
• scientific article; zbMATH DE number 1955855

Cites work

• A cyclic scheduling problem with an undetermined number of parallel identical processors
• A study of the cyclic scheduling problem on parallel processors
• An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
• 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
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Retiming synchronous circuitry
• Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays

Cited in

(9)

• Optimizing energy consumption of robotic cells by a branch \& bound algorithm
• An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources
• Debugging unsatisfiable constraint models
• The impact of core precedences in a cyclic RCPSP with precedence delays
• Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays
• Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
• scientific article; zbMATH DE number 1955855 (Why is no real title available?)
• Optimal software pipelining under resource constraints
• A robust basic cyclic scheduling problem

This page was built for publication: The resource-constrained modulo scheduling problem: an experimental study

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