Abstract
The article is devoted to the consideration of the current problem of developing heuristic approaches in operational scheduling of production processes. The purpose of the study is related to the development of methods and algorithms for generating schedules for an arbitrary number of request vectors. The problem was formulated and formalized using scheduling schemes and priority rules. For numerical experimentation, a model of a program for generating a railway schedule and a test task were developed, including 4573 applications for weekly schedules of a railway network containing 100 stations, 128 hauls between stations, 100 passenger routes of different frequencies, 471 trains per week. The developed program model, in addition to carrying out calculations using the presented algorithms, visualizes the results of numerical experimentation in the form of spiral representations of station and haul schedules. The performance of the developed methods and algorithms has been confirmed. Conclusions and discussion of the study results are presented.
Sign-in/Register to access full text options 
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.
