Abstract
Statement of the problem of service request for repair is formalized and algorithms of solution are presented. An algorithm is designed for the service of the greatest number of requests for repair within the established deadlines. An algorithm is proposed for constructing the optimal sequence of servicing repair requests. The optimal sequence is determined basing on the least total time of delays while completion of the requests service within the established deadlines. Usage of the optimization algorithms for the service of requests for repair in certain examples.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.