An ACO algorithm for scheduling a flow shop with setup times

被引：1

作者：

Rojas-Santiago M. ^{[1
]}

Muthuswamy S. ^{[2
]}

Hulett M. ^{[3
]}

机构：

[1] Department of Industrial Engineering, Universidad Del Norte, Barranquilla

[2] Department of Technology, College of Engineering and Engineering Technology, Northern Illinois University, De Kalb, 60115, IL

[3] Department of Management Science, School of Business, University of Miami, Coral Gables, 33146, FL

来源：

International Journal of Industrial and Systems Engineering | 2020年 / 36卷 / 01期

关键词：

ACO; Ant colony optimisation; Flow shop; Makespan; Particle swarm optimisation; PSO; Scheduling; Setup time;

D O I：

10.1504/IJISE.2020.109123

中图分类号：

学科分类号：

摘要：

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. © 2020 Inderscience Enterprises Ltd.. All rights reserved.

引用

页码：98 / 109

页数：11

共 50 条

[21] Hybrid genetic algorithm for job shop scheduling with sequence-dependent setup times
Zhou, H.
Zhang, H.M.
Hangkong Xuebao/Acta Aeronautica et Astronautica Sinica, 2001, 22 (02): : 180 - 183
[22] Genetic Algorithm Combined with Tabu Search for the Job Shop Scheduling Problem with Setup Times
Gonzalez, Miguel A.
Vela, Camino R.
Varela, Ramiro
METHODS AND MODELS IN ARTIFICIAL AND NATURAL COMPUTATION, PT I: A HOMAGE TO PROFESSOR MIRA'S SCIENTIFIC LEGACY, 2009, 5601 : 265 - +
[23] Green Hybrid Flow Shop Scheduling Problem Considering Sequence Dependent Setup Times and Transportation Times
Wu, Shaoxing
Liu, Li
IEEE ACCESS, 2023, 11 : 39726 - 39737
[24] Heuristics for the Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup times
Yong, Liao
Zhantao, Li
Xiang, Li
Chenfeng, Peng
Mathematical Problems in Engineering, 2022, 2022
[25] A discrete differential evolution algorithm for flow shop group scheduling problem with sequence-dependent setup and transportation times
Yuan, Shuaipeng
Li, Tieke
Wang, Bailin
JOURNAL OF INTELLIGENT MANUFACTURING, 2021, 32 (02) : 427 - 439
[26] A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times
Liou, Cheng-Dar
Hsieh, Yi-Chih
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2015, 170 : 258 - 267
[27] Hybrid Estimation of Distribution Algorithm for Blocking Flow-Shop Scheduling Problem with Sequence-Dependent Setup Times
Zhang, Zi-Qi
Qian, Bin
Liu, Bo
Hu, Rong
Zhang, Chang-Sheng
INTELLIGENT COMPUTING THEORIES AND APPLICATION, PT I, 2018, 10954 : 628 - 637
[28] A hybrid genetic algorithm for the hybrid flow shop scheduling problem with machine blocking and sequence-dependent setup times
Ferreira Maciel, Ingrid Simoes
Prata, Bruno de Athayde
Nagano, Marcelo Seido
de Abreu, Levi Ribeiro
JOURNAL OF PROJECT MANAGEMENT, 2022, : 201 - 216
[29] ACO-LS Algorithm for Solving No-wait Flow Shop Scheduling Problem
Riyanto, Ong Andre Wahyu
Santosa, Budi
INTELLIGENCE IN THE ERA OF BIG DATA, ICSIIT 2015, 2015, 516 : 89 - 97
[30] A dual-criteria flow shop scheduling with sequence-dependent setup times
Nailwal, Kewal Krishan
Gupta, Deepak
Sharma, Sameer
JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2015, 36 (05): : 485 - 500

← 1 2 3 4 5 →