Abstract
AbstractBeing a typical NP-hard combinatorial optimization problem, the hybrid flow shop (HFS) problem widely exists in manufacturing systems. In this paper, we firstly establish the model of the HFS problem by employing the vector representation. Then an improved discrete artificial bee colony (IDABC) algorithm is proposed for this problem to minimize the makespan. In the IDABC algorithm, a novel differential evolution and a modified variable neighborhood search are studied to generating new solutions for the employed and onlooker bees. The destruction and construction procedures are utilized to obtain solutions for the scout bees. The simulation results clearly imply that the proposed IDABC algorithm is highly effective and efficient as compared to six state-of-the-art algorithms on the same benchmark instances.Keywordshybrid flow shop problemmathematical modelartificial bee colonydifferential evolutionscheduling
Published Version
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