Abstract
Based on Plant Growth Simulation Algorithm, we propose a novel algorithm for solving permutation flow shop scheduling problems. Starting with the characteristic of permutation flow shop scheduling problems, combining disjunctive graph according to the sequence of scheduling, analyzing Scheduling options that decided by exchangeable set and alternative set. Simulation results that the Plant Growth Simulation Algorithm (PGSA) has better feasibility and validity for solving permutation flow shop scheduling problem.
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.
