In the normal life span of large enterprises, the strategic management of IT often evolves. Existing services must be replaced with new services without impairing operations. The problem of scheduling such replacement is of critical importance for the success of the operation. We analyze this problem from a quantitative point of view, underlining the trade-off nature of its solutions. We formalize this multiobjective optimization problem as a mathematical programming formulation. We discuss its theoretical properties and show that real-world instances can be solved by standard off-the-shelf tools.
BelottiPLeeJLibertiL. (2009) Branching and bounds tightening techniques for non-convex MINLP. Optimization Methods and Software24(4): 597–634.
2.
BernusPMertinsKSchmidtG (2006) Handbook on Architectures of Information Systems. Berlin: Springer.
3.
BliudzeSKrobD (2006) Towards a functional formalism for modelling complex industrial systems. ComPlexUs (Special Issue: Complex Systems – European Conference 2005)2(3–4): 163–176.
4.
CaseauY (2007) Performance du Système d’Information – Analyse de la Valeur, Organisation et Management (in French). Paris: Dunod.
5.
EhrgottM (2005) Multicriteria Optimization. New York: Springer.
6.
FortetR (1960) Applications de l’algèbre de Boole en recherche opérationelle. Revue Française de Recherche Opérationelle4: 17–26.
7.
FourerRGayD (2002) The AMPL Book. Pacific Grove, CA: Duxbury Press.
8.
GeoffrionA (1968) Proper efficiency and the theory of vector maximization. Journal of Mathematical Analysis and Applications22: 618–630.
9.
GiakoumakisVKrobDLibertiL. (2010) Optimal technological architecture evolutions of information systems. In: AiguierMBretaudeaueFKrobD (eds) Complex Systems Design and Management. Berlin: Springer, pp. 137–148.
10.
IBM (2010) ILOG CPLEX 12.2 User’s Manual. IBM.
11.
KrobD. (2006), Modelling of Complex Software Systems : a Reasoned Overview, [in “26th IFIP WG 6.1 International Conference on Formal Methods for Networked and Distributed Systems” (FORTE’ 2006), NajmE.Pradat-PeyreJ.-F.Viguié Donzeau-GougeV., Eds.], Lecture Notes in Computer Science, 4229, 1–22, Springer Verlag.
12.
LibertiL (2009) Reformulations in mathematical programming: definitions and systematics. RAIRO-Operations Research43(1): 55–86.
13.
LibertiLCafieriSTarissanF (2009) Reformulations in mathematical programming: a computational approach. In: AbrahamAHassanienA-ESiarryP. (eds) Foundations of Computational Intelligence, vol. 3 (number 203 in Studies in Computational Intelligence). Berlin: Springer, pp. 153–234.
14.
LuftmanJN (2003) Competing in the Information Age. Oxford: Oxford University Press.
