Abstract
In job shop scheduling, we attempt to optimally assign a set of machines to a set of operations. The purpose of this research is to develop an improved biogeography-based optimization approach in order to minimize makespan in the job shop scheduling problems. Stepwise delineation of the proposed approach is provided and twenty-two well-studied problem instances of job shop scheduling are solved by the proposed improved biogeography-based optimization in order to prove its efficiency and effectiveness. The numerical results indicate that the proposed algorithm is able to provide optimal or near-optimal schedules for all of the problem instances.
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.
