Abstract
Job Shop scheduling problem is one of the most complex and researched problems in the field of production planning. In this paper, two methods for solving Job Shop scheduling problem are presented and comยญpared. The genetic algorithm and variable neighborhood search method were chosen and implemented in software for solving Job Shop problem. The paper first briefly presents Job Shop scheduling problem and then exยญplains the development of solving software and implementation of selected solution methods. The results of using implemented genetic algorithm and variable neighborhood search method are presented on test instances with various dimensions. Solutions obtained using these two methods were put in comparison and analyzed, as well as compared with the optimal or best-known solutions in the literature.
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.
