Abstract
Production scheduling has been recognized as common but challenging combinatorial problems. Because of their complexity, recent research has turned to genetic algorithms to address such problems. Although genetic algorithms have been proven to facilitate the entire space search, they lack in fine-tuning capability for obtaining the global optimum. Therefore, in this study a hybrid genetic algorithm was developed for optimization. Scheduling problems often involve more than one criterion and therefore require multicriteria analysis. Therefore a multicriteria flowshop scheduling problem with setup times is considered. The objective function of the problem is minimization of the weighted sum of total completion time, makespan, maximum tardiness and maximum earliness. An integer programming model is developed for the problem which belongs to NP-hard class. According to computational results, the hybrid genetic algorithm proposed is effective in finding problem solutions.
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.
