Abstract
The objective of this article is the definition of an algorithm aimed to settle the sequence of implementation of Information Technology Infrastructure Library (ITIL) processes that should be followed in the technology departments for its proper management. The mathematical model presented solves the question of the best ITIL process to implement by using an optimization function that considers the objectives and restrictions given by the company. This model is the basis for an iterative greedy algorithm proposed that generates the optimal sequence of ITIL processes to implement. The algorithm has been proven in a company with satisfactory results: the proposed sequence of implementation allowed the company to properly manage the IT department as well as get close to competitors based on the objectives and restrictions reported by the company. The novelty of this contribution relies on the design of an algorithm to generate an optimal and specific sequence of ITIL processes to implement in the IT department of a company, as the previous solutions relied on generic sequences or required external consultants to get their opinion and so did not have a mathematical basis.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference53 articles.
1. Supporting the Module Sequencing Decision in ITIL Solution Implementation
2. Towards a poolimg of ITIL v3 and COBIT;Bahsani;Int. J. Comput. Sci. Issues,2011
3. De la Administración al Gobierno de TIhttp://52.0.140.184/typo43/fileadmin/Revista_97/7_-_tres.pdf
4. COBIT in relation to other international standars;Hesch;Inf. Syst. Control J.,2004
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献