Abstract
This paper is a summary of the author’s PhD thesis entitled “Models and algorithms for the reconfiguration of wireless switching systems”. The thesis deals with the study of a strongly NP-hard resource-constrained scheduling problem arising from the telecommunication industry. This work was supervised by Jacques Carlier and Dritan Nace, both from Université de Technologie de Compiègne, and carried out while the author was a System Architect within Nortel GSM Access R&D organization. The thesis, which is written in both French and English, has been defended on 29 March 2007 and is available by email request to the author.
Similar content being viewed by others
References
Józsa BG, Makai M (2003) On the solution of reroute sequence planning problem in MPLS networks. Comput Networks 42:199–210
Kerivin H, Sirdey R (2007) Polyhedral combinatorics of a resource-constrained ordering problem part II: on the process move program polytope. Technical Report PE/BSC/INF/017913 V01/EN, Service d’architecture BSC, Nortel GSM Access R&D, France (submitted for publication)
Sirdey R (2007) Combinatorial optimization problems in wireless switch design. 4OR (in press)
Sirdey R, Kerivin H (2006) A branch-and-cut algorithm for a resource-constrained scheduling problem. RAIRO—Oper Res (in press)
Sirdey R, Kerivin H (2007) Polyhedral combinatorics of a resource-constrained ordering problem part I: on the partial linear ordering polytope. Technical Report PE/BSC/INF/017912 V01/EN, Service d’architecture BSC, Nortel GSM Access R&D, France (submitted for publication)
Sirdey R, Plainfossé D, Gauthier J-P (2003) A practical approach to combinatorial optimization problems encountered in the design of a high availability distributed system. In: Proceedings of INOC, pp 532–539
Sirdey R, Carlier J, Kerivin H, Nace D (2005) On a resource-constrained scheduling problem with application to distributed systems reconfiguration. Eur J Oper Res (in press)
Sirdey R, Carlier J, Nace D (2006) Approximate resolution of a resource-constrained scheduling problem. J Heuristics (in press)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported in part by Association Nationale de la Recherche Technique grant CIFRE-121/2004.
Rights and permissions
About this article
Cite this article
Sirdey, R. Models and algorithms for the reconfiguration of distributed wireless switching systems. 4OR 6, 195–198 (2008). https://doi.org/10.1007/s10288-007-0048-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-007-0048-2
Keywords
- Scheduling
- Polyhedral combinatorics
- Branch-and-bound
- Branch-and-cut
- Simulated annealing
- Distributed systems