Abstract
This paper considers two stage hybrid flow shop (HFS) with identical parallel machine. The objectives is to determine makespan have been minimized. This paper presented memetic algorithm procedure to solve two stage HFS problems. To evaluated performance of propose method, the results have been compared with two meta-heuristic, genetic algorithm, simulated annealing. The experimental results show that propose method is more effective and efficient than genetic algorithm and simulated annealing to solve two stage HFS scheduling problems.
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.
