SCOPING OF PILOT TESTING OF ENTERPRISE RESOURCE PLANNING

 Planning of pilot testing is among important problems of creation of Enterprise resource planning. Pilot (experimental) projects are  intended for testing of the main functions of the created system by  limited number of “advanced” users. A key task when planning pilot testing is determination of its volume. If the volume of the pilot  project is small, then essentially important functions of system can be  not checked, and the probability of detection of essential mistakes at  full introduction will be high. If the volume is big, then amount of  works on implementation of the pilot project considerably increases, and there will be no necessary speed and flexibility of testing of the  main functions, because of which pilot testing is organized, and its  efficiency will be close to efficiency of full introduction. The article describes mathematical problem definition of pilot testing scoping which  relies on results of the solution of formation problems of a portfolio  of IT services and creation scheduling of Enterprise resource planning  of the large metallurgical company. The solutions for the considered  task are sets of the services and communications which are subject to  check between them satisfying to the set restriction for volume of the  resources allocated for testing realization, and delivering an optimum  to the set criterion. The procedure of the task solution is based on network programming method which relies on structural and similar network representation of criterion and restrictions. The procedure and an  example of the solution of the studied task in which separate estimated  tasks are solved by method of dichotomizing programming are shown.  The received approximate solutions of an objective can be improved by means of the solution of a dual problem of network programming.  For the purpose of finding of initial task global optimum, the method of  branches and borders can be used in which the criterions of function of  the found approximate solutions are applied as border values. The considered task can be generalized for preferences of the consumers of IT  service concerning need of check of services various communications.  These preferences can be considered by introduction of “scales” of the  corresponding communications. The general scheme of the solution of  a task at the same time doesn’t change.

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

2. Belikov D.V . Application of service model to meet the IT needs of  enterprises. Vestnik Samarskogo gosudarstvennogo ekonomicheskogo universiteta. 2011, no. 84, pp. 9–14. (In Russ.).

3. Zimin V.V., Burkova I.V., Zimin A.V . Modeli i mekhanizmy upravleniya zhiznennym tsiklom IT-servisov [Models and mechanisms  for life cycle management of IT services]. LAP LAMBERT, 2017,  336  p.

4. Zimin V.V., Mit’kov V.V., Zimin A.V . Formation of functional volume and working groups of ERP-project of the enterprise. Izvestiya VUZov. Chernaya metallurgiya = Izvestiya. Ferrous Metallurgy.  2017, no. 12, pp. 998–1004. (In Russ.).

5. Zimin V.V., Mit’kov V.V., Zimin A.V . Calendar planning of ITservices of the enterprise’s ERP-project. Izvestiya VUZov. Chernaya metallurgiya = Izvestiya. Ferrous Metallurgy. 2018, no. 4,   pp. 319–325. (In Russ.).

6. Andronnikova N.G., Barkalov S.A., Burkov V.N., Kotenko A.M.  Modeli i metody optimizatsii regional’nykh programm razvitiya [Models and methods for regional development programs optimization]. Moscow: IPU RAN, 2001, 60 p. (In Russ.).

7. Andronnikova  N.G.,  Burkov  V.N.,  Leont’ev  S.V .  Kompleksnoe otse nivanie v zadachakh regional’nogo upravleniya [Comprehensive assessment in regional administration tasks]. Moscow: IPU  RAN, 2002, 54 p. (In Russ.).

8. Balashov V.G., Zalozhnev A.Yu., Ivashenko A.A., Novikov D.A.  Mekhanizmy upravleniya organizatsionnymi proektami [Management mechanisms of organizational projects]. Moscow: IPU RAN,  2003, 84 p. (In Russ.).

9. Barkalov S.A., Burkov V.N., Gilyazov N.M. Metody agregirovaniya v upravlenii proektami [Methods of aggregation in project  management]. Moscow: IPU RAN, 1999, 55 p. (In Russ.).

10. Barkalov P.S., Burkova I.V., Glagolev A.V., Kolpachev V.N. Zadachi raspredeleniya resursov v upravlenii proektami [Methods of aggregation in project management]. Moscow: IPU RAN, 2002, 65  p.  (In Russ.).

11. Barkalov S.A., Burkov V.N., Kurochka P.N., Obraztsov N.N. Zadachi upravleniya material’no-tekhnicheskim snabzheniem v rynochnoi ekonomike [Tasks of procurement management in market  economy]. Moscow: IPU RAN, 2000, 58 p. (In Russ.).

12. Barkalov S.A., Burkov V.N. Minimizatsiya upushchennoi vygody v zadachakh upravleniya proektami [Minimization of lost profits  in project management tasks]. Moscow: IPU RAN, 2001, 56 p. (In  Russ.).

13. A guide to the project management body of knowledge (PMBOK®  guide), 2000, 215 p. 

14. Christensen D.S. An analysis of costs overruns on defense acquisition contracts. International Journal of Project Management. 1993,  vol. 24, no. 3, pp. 43–48.

15. Czamecki M.T. Managing by measuring: How to improve your organization’s performance through effective benchmarking. N.Y.:  American management association, 1999, 268 р. 

16. Dinsmore P.C. Winning in business with enterprise project management. N.Y.: American management association, 1999, 271 p.

17. Fleming Q.W., Hoppelman J.M. Earned value Project Management. PMI, 1996. 141 p.

18. Burkova I.V . Metod setevogo programmirovaniya v zadachakh upravleniya proektami: avtoref. dis... doktora tekh. nauk [Method of  network programming in project management tasks: Extended Abstract of Dr. Sci. Diss.]. Moscow, 2012, 40 p. (In Russ.).

19. Burkova I.V . A method of network programming in problems of  nonlinear  optimization.  Automation and Remote Control.  2009,  vol.  70, no. 10, pp. 1606–1612.

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