A branch-and-cut algorithm for a resource-constrained scheduling problem

DOI10.1051/ro:2007021zbMath1213.90126OpenAlexW2065779413MaRDI QIDQ3004200

Renaud Sirdey, Hervé L. M. Kerivin

Publication date: 1 June 2011

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

Full work available at URL: https://eudml.org/doc/105372

zbMATH Keywords

schedulingdistributed systemsbranch-and-cutpolyhedral combinatorics

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Distributed systems (68M14)

Related Items (2)

Models and algorithms for the reconfiguration of distributed wireless switching systems ⋮ Approximate solution of a resource-constrained scheduling problem

Uses Software

• LOLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate solution of a resource-constrained scheduling problem
• Induced binary probabilities and the linear ordering polytope: A status report
• Geometric algorithms and combinatorial optimization
• On an approximation measure founded on the links between optimization and polynomial approximation theory
• On a resource-constrained scheduling problem with application to distributed systems reconfiguration
• A Cutting Plane Algorithm for the Linear Ordering Problem
• On the acyclic subgraph polytope
• Facets of the linear ordering polytope
• Scheduling File Transfers
• The load rebalancing problem
• Algorithmic aspects of using small instance relaxations in parallel branch-and-cut

This page was built for publication: A branch-and-cut algorithm for a resource-constrained scheduling problem