Modification of the Genetic Algorithm for Building and Reconfiguring Schedules of Order Completion in the Field of Service Provision

The paper offers a solution to an important scientific and applied problem of scheduling to complete the orders for the provision of services aimed at maintenance and support of computer networks and equipment. This problem is relevant for companies providing such services. The main idea is to form an effective schedule for the completion of orders, as well as to enable its modification in the shortest time when getting orders. The paper also proposes an evaluation function that takes into account bonuses for the timely completion of orders and penalties for the late ones. A combination of a genetic algorithm with the methods of additional improvement on the basis of local optimization is offered. It allows reducing the time for the construction of effective alternative variants of decisions and their estimation. The use of the proposed approach to combining algorithms allows creating and reconfiguring the schedule for the completion of orders in the operational mode in a short time, and optimization makes it possible to reduce the completion of orders by up to 20%. Thus, the application of the proposed approaches will allow effective distribution of tasks among performers and give an economic effect by reducing the time to complete all orders.