An ACO algorithm for scheduling a flow shop with setup times
by Miguel Rojas-Santiago; Shanthi Muthuswamy; Maria Hulett
International Journal of Industrial and Systems Engineering (IJISE), Vol. 36, No. 1, 2020

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.

Online publication date: Fri, 21-Aug-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email