Model and algorithm for forming the optimum logistic plan of the complex of the related works

Abstract

A model and an algorithm for the formation of an optimal logistic plan for the implementation of a complex of related works are proposed. The model is based on the presentation of the optimization procedure in the form of a non-linear problem of discrete programming, consisting in minimizing the execution time of a complex of related works by a limited number of partially interchangeable executors, while limiting the total cost of work.

Keywords

• комплекс взаимосвязанных работ
• логистический план
• оптимизация
• модель
• алгоритм