Approximate solution of a resource-constrained scheduling problem

DOI10.1007/S10732-007-9052-0MaRDI QIDQ1009198zbMATH OpenOpenAlexFDO

Authors Renaud Sirdey, Jacques Carlier, Dritan Nace

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

OR in telecommunicationsSchedulingCombinatorial optimizationDistributed systemsSimulated annealing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1560337
• On approximating a scheduling problem
• scientific article; zbMATH DE number 4149886
• Approximability of scheduling problems with resource consuming jobs
• Approximation algorithms for scheduling with resource and precedence constraints
• scientific article; zbMATH DE number 850325
• scientific article; zbMATH DE number 1182771
• Approximation algorithms for time constrained scheduling
• Approximating the discrete resource sharing scheduling problem
• A unified approach to approximating resource allocation and scheduling

Cites work

• scientific article; zbMATH DE number 3145626 (Why is no real title available?)
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1865680 (Why is no real title available?)
• A branch-and-cut algorithm for a resource-constrained scheduling problem
• A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
• Approximate solution of a resource-constrained scheduling problem
• Convergence of an annealing algorithm
• On a resource-constrained scheduling problem with application to distributed systems reconfiguration
• On an approximation measure founded on the links between optimization and polynomial approximation theory
• Optimization by simulated annealing
• Simulated annealing - to cool or not
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Cited in

(9)

• Approximation of the supply scheduling problem
• On a resource-constrained scheduling problem with application to distributed systems reconfiguration
• scientific article; zbMATH DE number 4149886 (Why is no real title available?)
• scientific article; zbMATH DE number 850325 (Why is no real title available?)
• A branch-and-cut algorithm for a resource-constrained scheduling problem
• A unified approach to approximating resource allocation and scheduling
• Models and algorithms for the reconfiguration of distributed wireless switching systems
• Approximate solution of a resource-constrained scheduling problem
• An approximate solution to the linear problem of minimizing resource consumption

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

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