Abstract
The paper suggests one of the approaches to solving the problem of planning multi-stage service systems, the distinguishing feature of which is the availability of time constraints and a resource criterion. At the heart of the approach lie heuristics, which make it possible to obtain a suboptimal solution in an acceptable time. Based on these heuristics, the process of making decisions about assigning jobs to a given time interval, determining the optimal time interval for the return, and estimating the remaining service time are carried out.
Highlights
The efficiency of the functioning of the servicing systems is largely determined by the quality of scheduling
The necessity of processing of multiple applications with individual service options, including the solution of a large number of interdependent tasks, time and resource constraints, the presence of several service centers cause the development of algorithms and software systems that allow you to obtain a schedule of works which is optimal from the point of view of a given criterion, and to automate the process of its formation
The algorithms for solving these problems are based on the CMP (Critical Path Method) approach, which is a technique for determining the start time of works with the presence of the constraints on mutual dependence and without taking into account resource constraints
Summary
The efficiency of the functioning of the servicing systems is largely determined by the quality of scheduling. The necessity of processing of multiple applications with individual service options, including the solution of a large number of interdependent tasks, time and resource constraints, the presence of several service centers cause the development of algorithms and software systems that allow you to obtain a schedule of works which is optimal from the point of view of a given criterion, and to automate the process of its formation. This problem belongs to the class of NP-complete problems of scheduling theory. The third part is devoted to detailing such stages of the algorithm as the choice of a possible stage for a return, the lower estimate of the completion time of the project, and the determination of the planning moment
Sign-in/Register to view highlights & summary 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 callMore From: International Journal of Engineering & Technology
Disclaimer: 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.
