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

DOI10.1051/RO:2007021MaRDI QIDQ3004200zbMATH OpenOpenAlexFDO

Authors 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, https://hal.inria.fr/inria-00311533/file/RAIRO.pdf

zbMATH Keywords

branch-and-cutdistributed systemspolyhedral combinatoricsscheduling

Mathematics Subject Classification ID

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

Recommendations

• A branch-and-bound algorithm for the resource-constrained project scheduling problem
• A branch and bound algorithm for the resource-constrained project scheduling problem
• A branch-and-bound algorithm for one class of scheduling problem
• A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems
• A branch and bound algorithm for the job-shop scheduling problem
• scientific article; zbMATH DE number 432991
• A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem
• scientific article; zbMATH DE number 34437
• A decomposition approach for a resource constrained scheduling problem
• A branch and bound algorithm for the flow-shop scheduling problem

Cites work

• A Cutting Plane Algorithm for the Linear Ordering Problem
• Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
• Approximate solution of a resource-constrained scheduling problem
• Facets of the linear ordering polytope
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 3902051 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 575382 (Why is no real title available?)
• scientific article; zbMATH DE number 1489805 (Why is no real title available?)
• scientific article; zbMATH DE number 1848399 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Induced binary probabilities and the linear ordering polytope: A status report
• On a resource-constrained scheduling problem with application to distributed systems reconfiguration
• On algorithms for efficient data migration
• On an approximation measure founded on the links between optimization and polynomial approximation theory
• On the acyclic subgraph polytope
• Scheduling File Transfers
• The load rebalancing problem

Cited in

(7)

• Approximate solution of a resource-constrained scheduling problem
• A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
• On a resource-constrained scheduling problem with application to distributed systems reconfiguration
• scientific article; zbMATH DE number 432991 (Why is no real title available?)
• Reservation table scheduling: branch-and-bound based optimizationvs. integer linear programming techniques
• A polyhedral study of a relaxation of the routing and spectrum allocation problem
• Models and algorithms for the reconfiguration of distributed wireless switching systems

Describes a project that uses

Uses Software

• LOLIB

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

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