Approximate solution of a resource-constrained scheduling problem

Authors:
Renaud Sirdey;Jacques Carlier;Dritan Nace
Affiliations:
Service d'architecture BSC, Nortel GSM Access R&D, Yvelines Cedex 09, France 78928 and UMR CNRS Heudiasyc, Universitéé de Technologie de Compiègne, Compiègne Cedex, France 6020 ...;UMR CNRS Heudiasyc, Université de Technologie de Compiègne, Compiègne Cedex, France 60205;UMR CNRS Heudiasyc, Université de Technologie de Compiègne, Compiègne Cedex, France 60205
Venue:
Journal of Heuristics
Year:
2009

Citing 6
Cited 1

Convergence of an annealing algorithm

Mathematical Programming: Series A and B
Theory of linear and integer programming

Theory of linear and integer programming
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Simulated annealing—to cool or not

Systems & Control Letters
On an approximation measure founded on the links between optimization and polynomial approximation theory

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

A GRASP for a resource-constrained scheduling problem

International Journal of Innovative Computing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is devoted to the approximate solution of a strongly NP-hard resource-constrained scheduling problem which arises in relation to the operability of certain high availability real time distributed systems. We present an algorithm based on the simulated annealing metaheuristic and, building on previous research on exact solution methods, extensive computational results demonstrating its practical ability to produce acceptable solutions, in a precisely defined sense. Additionally, our experiments are in remarkable agreement with certain theoretical properties of our simulated annealing scheme. The paper concludes with a short discussion on further research.