Abstract
Control front algorithm for solving the distribution of works by performers is suggested, which allows finding the optimal allocation, which fits into a specified time and minimizes total cost. Solution of the problem of the distribution of works by classical methods (network planning, branch and bound, Gantt) is not possible, since the execution of the work depends on the performer, the appointment of the performer for a particular job takes place only after the optimal allocation of previous work and depends on the time you complete the previous works, and almost always there is the possibility of performance of works by other performers.
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.
