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

DOI10.1016/J.EJOR.2006.10.011zbMATH Open1180.90137OpenAlexW1975166520MaRDI QIDQ2371345FDOQ2371345

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

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

zbMATH Keywords

branch and boundOR in telecommunications

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Where are the hard knapsack problems?
• On an approximation measure founded on the links between optimization and polynomial approximation theory
• Title not available (Why is that?)
• Linear probing and graphs
• Scheduling File Transfers
• 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
• The Power of Dominance Relations in Branch-and-Bound Algorithms
• On algorithms for efficient data migration
• Title not available (Why is that?)
• Approximate solution of a resource-constrained scheduling problem
• The load rebalancing problem

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
• Virtual network function reconfiguration in 5G networks: an optimization perspective
• Models and algorithms for the reconfiguration of distributed wireless switching systems
• 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)