Abstract
We investigate the genetic algorithm approach for scheduling hybrid flow shops with minimum makespan as performance measure. The hybrid flow shop problem is characterized as the scheduling of jobs in a flow shop environment where, at any stage, there may exist multiple machines. The algorithm is based on the list scheduling principle by developing job sequences for the first stage and queuing the remaining stages in a FIFO manner. Experiments show that the proposed algorithm outperforms existing heuristic procedures and random search methods.
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.
