FORMATION OF FUNCTIONAL VOLUME AND WORKING GROUPS OF ERP-PROJECT OF THE ENTERPRISE

Critical in the creation of ERP-system of the enterprise is the first stage of the system. Simultaneous introduction of all services for all business processes of the enterprise, as a rule, isn’t possible or expedient for various reasons: lack of sufficient resources, difficulties of creation of necessary technical infrastructure in short terms, big risks of radical reorganization of the operating control system, etc. Therefore, the functional volume of the 1st turn of the project joins the IT services providing effective functioning of the most interconnected business processes. The paper presents a mathematical formulation and procedure for solving the problem of determining the portfolio of IT services that realize the functions of the main business processes and make up the functional volume of the first stage of the ERP system of a large metallurgical company. Problem definition considers three important indicators of efficiency of the ERP-project: size of the project budget, number of communications between the IT services making the functional volume of the project (its “integration kernel”), number of the inherited design decisions from the systems of a “scrappy” computerization finding application in the enterprise resource planning. The first of these indicators is accepted as criterion of a task, other two – as its restrictions. As a result of formalization, the problem under consideration reduces to the problem of integer-valued quadratic programming. The method of network programming in modification used for the solution of nonlinear programming problems of is applied for its decision. The method decomposes a complex initial problem into a generalized dual task of network programming and a set of essentially simpler subtasks. An example is given of the solution of the problem under study in which the generalized dual problem of network programming is solved by the method of Lagrange multipliers, and individual subtasks are solved by the method of dichotomous programming, which reduces the solution of subproblems to the solution of a sequence of simple estimation problems. The solution of the task of forming a portfolio of services delivers the initial data for the task of scheduling the implementation of services by project groups responsible for the computerization of individual business processes of the enterprise. 

1. OGC-ITIL V3-1 Service Strateqy. TSO, 2007, 373 p.

2. OGC-ITIL V3-2 Service Desiqn. TSO, 2007, 334 p.

3. OGC-ITIL V3-3 Service Transition. London: TSO, 2007, 270 p.

4. OGC-ITIL V3- 4, Service Operation. TSO, 2007, 397 p.

5. OGC-ITIL V3- 5 Continual Service Improvment. TSO, 2007, 308 p.

6. OGC-ITIL V3- 6 Service Lifecycle, Introduction ITIL. TSO, 2007, 173 p.

7. Zimin V.V., Kulakov S.M., Zimin A.V. Development of conceptual base for managing IT activities. Vestnik NGU. Seriya “Informatsionnye tekhnologii”. 2012, vol. 10, iss. 4, pp. 29–39. (In Russ.).

8. Zimin V.V., Ivushkin A.A., Kulakov S.M., Ivushkin K.A. Osnovy upravleniya zhiznennym tsiklom servisov sistem informatiki i avtomatizatsii (luchshie praktiki ITIL): uchebnoe posobie [Basics of life-cycle management of information and automation systems services (best practices of ITIL): Tutorial]. Kemerovo: Kuzbassvuzizdat, 2013, 500 p. (In Russ.).

9. Burkov V.N., Novikov D.A. Kak upravlyat’ proektami: Nauchnoprakticheskoe izdanie [How to manage projects: Scientific and practical references]. Moscow: SINTEG – GEO, 1997, 188 p. (In Russ.).

10. Phillips J.J., Bothell T.W., Snead G.L. The project management scorecards. Amsterdam: Elseiver, 2003.

11. Rumizen M.C. Knowledge management. N.Y.: Alpha, 2002.

12. Wysocky R.K., Beck R., Crane D.B. Effective project management. NY: John Wiley & Sons, 2000.

13. Mekhanizmy upravleniya: uchebn. posobie [Control mechanisms: Manual]. Novikov D.A. ed. Moscow: LENAND, 2011, 192 p. (In Russ.).

14. Wagner Harvey M. Principles of operations research. PrenticeHall, 1967. (Russ.ed.: Vagner G. Osnovy issledovaniya operatsii. Moscow: Mir, 1972, 198 p.).

15. Burkova I.V. Metod setevogo programmirovaniya v zadachakh upravleniya proektami: Avtoref. diss. ... doktora tekhn. nauk [Method of network programming in project management tasks: Extended Abstract of Dr. Sci. Diss.]. Moscow, 2012, 27 p. (In Russ.).

16. Burkova I.V. Method of network programming in tasks of nonlinear optimization. Avtomatika i telemekhanika. 2009, no. 10, pp. 15–21. (In Russ.).

17. Korbut A.A., Siga I.Kh., Finkel’shtein Yu.Yu. Method of branches and boundaries. Review of theory, algorithms, programs and applications. Math. Operation Forsch. Staist. Ser. Optimization. 1977, vol. 8, no. 2, pp. 253–280. (In Russ.).

18. Korbut A.A., Finkel’shtein Yu.Yu. Diskretnoe programmirovanie [Discrete Programming]. Moscow: Nauka, 1969, 368 p. (In Russ.).

19. Akulich I.L. Zadachi nelineinogo programmirovaniya. Matematicheskoe programmirovanie v primerah i zadachah [Problems of non-linear programming. Mathematical programming in examples and problems]. Moscow: Vysshaya shkola, 1986, 319 p. (In Russ.).

20. Zorich V.A. Matematicheskii analiz. Ch. 1 [Mathematical analysis. Part. 1]. Moscow: FAZIS, 1997, 568 p. (In Russ.).