Abstract
The article proposes and justifies an algorithm for dividing a project into batches, which allows you to choose the optimal path for its implementation, without resorting to detailed planning of the entire scope of work, based on local data on the state of the project and the nearest milestone. Categories of projects for which the viability of a flexible ap-proach to planning can be justified when the focus of project management is aimed at short-term goals are identified. For this purpose, a classification of projects into composite and indivisible, as well as into projects with and without memory is proposed. An example of the work of the developed algorithm for dividing a project into batches is considered, on the basis of which it is concluded that the algorithm complies with the best industry practices. The main directions for further research are listed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
