Abstract
In this paper, an evolutionary algorithm is introduced for the NP-hard multi-criteria no-wait flow shop scheduling problems. Both makespan and total flowtime are taken into account. The proposed algorithm makes use of non-dominated sorting strategy. Corresponding objective increment properties are analyzed to improve efficiency for searching Pareto solutions. Experimental results show that the proposal outperforms the other three heuristics currently available.
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.
