Abstract
Flow shop scheduling is one of the most well-known production scheduling problems and a typical NP-hard combinatorial optimization problem with strong engineering background. This paper presents an order-based genetic algorithm for flow shop scheduling, which borrows the idea of ordinal optimization to reduce computation and ensure the quality of the solution found and enforces the evolutionary searching mechanism and learning capability of the genetic algorithm. With the guidance of ordinal comparison and by emphasizing the order-based search and elitist-based evolution in the proposed approach, a good enough solution can be guaranteed with high confidence level and reduced computation quantity, which is demonstrated by the numerical simulation based on some benchmarks. Moreover, some parameter sensitivities are presented and discussed.
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.
