Scheduling a flow shop with setup times in a food processing industry
Author ORCID Identifier
Purushothaman Damodaran:https://orcid.org/0000-0002-6925-8486
Publication Title
Proceedings of the 2016 Industrial and Systems Engineering Research Conference, ISERC 2016
E-ISSN
44409
Document Type
Conference Proceeding
Abstract
The scheduling problem under study is a real life application in a food processing industry dedicated to cooking sauces and spices. An algorithm to minimize the makespan for the flow shop scheduling problem with setup times is presented. Given that this problem is considered NP-hard, an Ant Colony Optimization (ACO) approach is proposed to find an initial solution, which is improved further by using a 2-opt and 3-opt local heuristic. Computational experiments were performed with 60 randomly generated instances. The performance of the proposed algorithm was compared with the results from a Particle Swarm Optimization (PSO) metaheuristic. The results show that the proposed algorithm outperforms the PSO algorithm.
First Page
207
Last Page
212
Publication Date
1-1-2020
Keywords
ACO, Flow shop, Makespan, PSO, Scheduling, Setup time
Recommended Citation
Rojas-Santiago, Miguel; Hulett, María; Muthuswamy, Shanthi; and Damodaran, Purushothaman, "Scheduling a flow shop with setup times in a food processing industry" (2020). NIU Bibliography. 431.
https://huskiecommons.lib.niu.edu/niubib/431
Department
Department of Engineering Technology; Department of Industrial and Systems Engineering