Abstract
A flow shop scheduling problem with setup times has been studied in a food processing setting. This company packs cooking sauces and spices. The objective is to minimise the makespan (Cmax) taking the setup times into consideration. Given that this problem in NP-hard, an ant colony optimisation (ACO) algorithm has been developed to find the initial solution which is further improved using 2-opt and 3-opt local heuristic. Using Taillard's benchmark problems' processing times and randomly generated setup times, 60 problem instances were computed for 50 to 200 jobs using 10 and 20 machine scenarios. These Cmax values were compared against the results obtained through a particle swarm optimisation (PSO) metaheuristic. The results clearly show that the ACO algorithm schedules the machines consistently well to minimise the Cmax value in comparison to the PSO algorithm.
Sign-in/Register to access full text options 
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
