NET GRAF CALCULATION METHOD FOR JOB COMPLETION CONSIDERING OF RESOURSES AVAILABALE
Abstract
The research considers the activity based network of routines performed by the integrated servicing crews at the airport. The known algorithms for critical path claiming suppose that the activity duration is given and the beginning of any activity is determined. However, the beginning of the activity also depends on the presence of the necessary resources for the given period of time.The formal statement of the problem is described. For the solution of the problem the well-known algorithm for constructing the tree of the shortest paths of the network graph is used. Herewith we suppose, that activity durations are known and resources are sufficient in order to start each activity at the right time. Further, this algorithm is modified inorder to take into account available resources. The special two-dimensional matrix with rows showing resource units andcolumns denoting the equally separated time intervals is used to demonstrate the resources state. The numerical method is proposed for solving the optimization problem. The method is implemented using the Mathcad computing environment and validated by specific examples.The method is implemented as a complex automated solution for operational management of airport services in the critical situations.
About the Authors
G. V. Golovchenko
St. Petersburg State University of Civil Aviation
Russian Federation
Russian Federation
Director for the Development of Automated Technologies for Airlines, RIVC-Pulkovo,
Saint Petersburg
M. I. Rebezova
Transport Clearing House
Russian Federation
Russian Federation
Head of Non-Residents Department,
Moscow
References
1. Hoare H.R. Project Management Using Network Analysis. McGraw-Hill. London, 1973, 120 p.
2. Mukherjee S., Basu K. Solution of interval PERT/CPM network problems by a simplified tabular method. OPSEARCH, 2011, vol. 48, issue 4, pp. 355–370.
3. Vanhoucke M. Project Management with Dynamic Scheduling. Springe. Berlin, 2012, 310 p.
4. Kofman A., Debazej G. Setevye metody planirovanija i ih primenenie [Network planning methods and their application]. Moskva, Progress, 1969. (in Russian)
5. Ore O. Theory of Graphs. American Mathematical Society. Providence, 1962, 270 p.
6. Christofides N. Graph Theory. An Algorithmic Approach. Academic Press Inc., 1975, 415 p.
7. Andronov A.M., Rebezova M.I. Polynomial approximation of the activity time distribution in network diagrams. Automatic control and computer sciences, 2013, vol. 47, № 4, рр. 192–201.
8. Golovchenko G. V., Gubenko A. V., Maharev Je. I., Smurov M. Ju. Avtomatizacija proizvodstvennoj i finansovo-jekonomicheskoj dejatel'nosti predprijatij grazhdanskoj aviacii [Automation of Industrial, Financial and Economic activities of Civil Aviation enterprises]. M., Sputnik, 2016. 348 р. (in Russian)
9. Golovchenko G.V. K zadache optimizacii operativnogo upravlenija samoletovyletami v sbojnyh situacijah v ajeroportu [To the task of optimizing the operational management of aircraft departures in bad situations at an airport]. Vestnik Sankt-Peterburgskogo gosudarstvennogo universiteta grazhdanskoj aviatsyii, 2016, no. 1 (10), p. 98–106. (in Russian)
10. Golovchenko G.V. Metod optimizatsyii ocherjodnosti podgotovki samolyotov k vyiletu pri sboynyh situatsyiyah [Method for optimizing the order of preparation of aircraft for take-off in case of bad situations]. Vestnik Sankt-Peterburgskogo gosudarstvennogo universiteta grazhdanskoy aviatsyii, 2016, no. 2 (11). (in Russian)
Review
For citations:
Golovchenko G.V., Rebezova M.I. NET GRAF CALCULATION METHOD FOR JOB COMPLETION CONSIDERING OF RESOURSES AVAILABALE. Civil Aviation High Technologies. 2017;20(3):157-164. (In Russ.)
Views:
469
Email this article 
