Abstract
Bi-criteria improved genetic algorithm (IGA) for flowshop scheduling problem is proposed in this paper. The primary concern of flowshop scheduling problem considered in this work is to obtain the best sequence, which minimises the makespan and total flow time of all jobs. The initial population of the genetic algorithm is created using popular NEH constructive heuristic (Nawaz et al. 1983). In IGA, multi-crossover operators and multi-mutation operators are applied randomly to subpopulations divided from the original population to enhance the exploring potential and to enrich the diversity of the crossover templates. The performance of the proposed algorithm is demonstrated by applying it to benchmark problems available in the OR-Library. Computation results based on some permutation flowshop scheduling benchmark problems (OR-Library) show that the IGA gives better solution when compared with the earlier reported results.
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 callMore From: International Journal of Computer Integrated Manufacturing
Disclaimer: 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.
