Abstract
Many deterministic computational methods have addressed flow and job shop scheduling - both being highly representative, critical problems. Such methods become obsolete due to solution time and difficulty due to problem size. Evolutionary computation appears feasible for overcoming these problems because it can handle large problems, but at the expense of closeness to optimal solutions. This paper partially compares the two problems based on evolutionary computational method, the vibrational potential method (VPM). To compare this to the performance of older methods, genetic algorithms (GAs) are used in the shop flow domain. This paper outlines VPM features in scheduling showing new advantages in problem formulation and solution.
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.
