Optimal resource allocation and scheduling for the CELL BE platform

DOI10.1007/S10479-010-0718-XzbMath1214.90050OpenAlexW2017295921MaRDI QIDQ545538

Michela Milano, Luca Benini, Michele Lombardi, Martino Ruggiero

Publication date: 22 June 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0718-x

zbMATH Keywords

resource allocationinteger linear programmingconstraint programmingconstraint based schedulinghybrid solversmulticore platforms

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Logic-Based Benders Decomposition for Large-Scale Optimization

Uses Software

• ILOG SCHEDULE
• QUICKXPLAIN

Cites Work

• Unnamed Item
• Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
• Partitioning procedures for solving mixed-variables programming problems
• A survey of stream processing
• Logic-based Benders decomposition
• Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates
• Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
• Integrating Benders Decomposition Within Constraint Programming
• Multi-stage Benders Decomposition for Optimizing Multicore Architectures
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Optimal resource allocation and scheduling for the CELL BE platform