On a resource-constrained scheduling problem with application to distributed systems reconfiguration

DOI10.1016/J.EJOR.2006.10.011MaRDI QIDQ2371345zbMATH OpenOpenAlexFDO

Authors Renaud Sirdey, Jacques Carlier, Dritan Nace, Hervé L. M. Kerivin

Publication date 4 July 2007

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2006.10.011

zbMATH Keywords

branch and boundOR in telecommunications

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• A branch-and-cut algorithm for a resource-constrained scheduling problem
• Approximate solution of a resource-constrained scheduling problem
• Models and algorithms for the reconfiguration of distributed wireless switching systems
• Rescheduling to minimize makespan on a changing number of identical processors
• scientific article; zbMATH DE number 4072695

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1764950 (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?)
• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
• A new fully polynomial time approximation scheme for the Knapsack problem
• Approximate solution of a resource-constrained scheduling problem
• Linear probing and graphs
• On algorithms for efficient data migration
• On an approximation measure founded on the links between optimization and polynomial approximation theory
• Scheduling File Transfers
• The Power of Dominance Relations in Branch-and-Bound Algorithms
• The load rebalancing problem
• Where are the hard knapsack problems?

Cited in

(9)

• Combinatorial optimization problems in wireless switch design
• Minimum maximum reconfiguration cost problem
• Rerouting tunnels for MPLS network resource optimization
• A branch-and-cut algorithm for a resource-constrained scheduling problem
• A distributed exact algorithm for the multiple resource constrained sequencing problem
• Approximation schemes for parallel machine scheduling with non-renewable resources
• Models and algorithms for the reconfiguration of distributed wireless switching systems
• Virtual network function reconfiguration in 5G networks: an optimization perspective
• Approximate solution of a resource-constrained scheduling problem

This page was built for publication: On a resource-constrained scheduling problem with application to distributed systems reconfiguration

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