Abstract
Flowshop scheduling deals with determining the optimum sequence of jobs to be processed on several machines so as to satisfy some scheduling criterion. It is NP-complete. Heuristic algorithms use problem-specific information to yield a good working solution. Genetic algorithms are stochastic, adaptive, general-purpose search heuristics based on concepts of natural evolution. We have developed a new heuristic genetic algorithm (NGA) which combines the good features of both the GA and heuristic search. The NGA is run on several problems and its performance is compared with that of the conventional genetic algorithm and the well-known NEH heuristic. The NGA is seen to perform better in almost all instances.
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.
