Abstract
This paper addresses the problem of scheduling a set of independent jobs with setup times on a set of machines in a permutation flow shop environment. A metaheuristic known as the Migrating Birds Optimization (MBO for short) is designed for the minimization of the overall completion time. A computational study is conducted to analyze the efficiency of this approach on instances that can be found in Sistemas de Optimizacion Aplicada (http://soa.iti.es/problem-instances).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
