Reservation table scheduling: branch-and-bound based optimizationvs. integer linear programming techniques

DOI10.1051/ro:2007036zbMath1210.90128OpenAlexW2154260387MaRDI QIDQ3515395

Hadda Cherroun, Alain Darte, Paul Feautrier

Publication date: 29 July 2008

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2007__41_4_427_0

zbMATH Keywords

schedulingbranch-and-boundinteger linear programminghigh-level synthesisresource constraintsDijkstradis-equationsreservation tables

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Theory of compilers and interpreters (68N20)

Related Items (1)

A novel analytical integer optimization method for wavelet based subband coding

Uses Software

• CPLEX
• JaCoP
• MAHA

Cites Work

• A note on two problems in connexion with graphs
• Some efficient solutions to the affine scheduling problem. II: Multidimensional time
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reservation table scheduling: branch-and-bound based optimizationvs. integer linear programming techniques