Abstract
In this paper, a hybrid discrete particle swarm algorithm based on maximum fitness function is proposed for a dual-resources constrained flexible job shop scheduling problem with multiple optimisation objectives. An improved position updating mechanism of particles is used to effectively avoid the occurrence of infeasible solution. Additionally, a novel dynamic search strategy is designed to enhance the local exploiting search ability of discrete particle swarms. Finally, simulation results demonstrate that the proposed algorithm effectively decreases both the production time and production cost.
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 callMore From: International Journal of Computing Science and Mathematics
Disclaimer: 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.
