Models and algorithms for the reconfiguration of distributed wireless switching systems

被引：0

作者：

Sirdey, Renaud ^{[1
,2
]}

机构：

[1] Nortel GSM Access R&D, Serv Architecture BSC, PC 12A7, F-78928 Yvelines 09, France

[2] Univ Technol Compiegne, Lab Heudiasyc, F-60206 Compiegne, France

来源：

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | 2008年 / 6卷 / 02期

关键词：

scheduling; polyhedral combinatorics; branch-and-bound; branch-and-cut; simulated annealing; distributed systems;

D O I：

10.1007/s10288-007-0048-2

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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 Universite de Technologie de Compiegne, 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.

引用

页码：195 / 198

页数：4