NET GRAF CALCULATION METHOD FOR JOB COMPLETION CONSIDERING OF RESOURSES AVAILABALE
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 activit...
Saved in:
Main Authors: | G. V. Golovchenko, M. I. Rebezova |
---|---|
Format: | Article |
Language: | Russian |
Published: |
Moscow State Technical University of Civil Aviation
2017-06-01
|
Series: | Научный вестник МГТУ ГА |
Subjects: | |
Online Access: | https://avia.mstuca.ru/jour/article/view/1091 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Development and Evaluation of a Multi-Robot Path Planning Graph Algorithm
by: Fatma A. S. Alwafi, et al.
Published: (2025-05-01) -
NP-completeness of the Eulerian walk problem for a multiple graph
by: Alexander V. Smirnov
Published: (2024-03-01) -
IMPROVEMENT OF PASSENGER SERVICE PROCESSES OF DEPARTING FLIGHT BASED ON PROJECT MANAGEMENT METHODS
by: S. A. Kropiventseva
Published: (2018-12-01) -
Critical path analysis by bar chart : the new role of job progress charts /
by: Lowe, C. W.
Published: (1969) -
The Shortest Path Problem for a Multiple Graph
by: Alexander V. Smirnov
Published: (2017-12-01)