Approximate solution of a resource-constrained scheduling problem

DOI10.1007/S10732-007-9052-0zbMath1180.90138OpenAlexW2044312785MaRDI QIDQ1009198

Renaud Sirdey, Dritan Nace, Jacques Carlier

Publication date: 31 March 2009

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-007-9052-0

zbMATH Keywords

Combinatorial optimizationSimulated annealingSchedulingOR in telecommunicationsDistributed systems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

On a resource-constrained scheduling problem with application to distributed systems reconfiguration ⋮ Models and algorithms for the reconfiguration of distributed wireless switching systems ⋮ A branch-and-cut algorithm for a resource-constrained scheduling problem ⋮ Approximate solution of a resource-constrained scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Approximate solution of a resource-constrained scheduling problem
• Simulated annealing - to cool or not
• On an approximation measure founded on the links between optimization and polynomial approximation theory
• A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
• On a resource-constrained scheduling problem with application to distributed systems reconfiguration
• A branch-and-cut algorithm for a resource-constrained scheduling problem
• Convergence of an annealing algorithm

This page was built for publication: Approximate solution of a resource-constrained scheduling problem