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 条

[41] Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
Vela, Camino R.
Varela, Ramiro
Gonzalez, Miguel A.
JOURNAL OF HEURISTICS, 2010, 16 (02) : 139 - 165
[42] An improved Jaya algorithm for solving the flexible job shop scheduling problem with transportation and setup times
Li, Jun-qing
Deng, Jia-wen
Li, Cheng-you
Han, Yu-yan
Tian, Jie
Zhang, Biao
Wang, Cun-gang
KNOWLEDGE-BASED SYSTEMS, 2020, 200
[43] Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
Camino R. Vela
Ramiro Varela
Miguel A. González
Journal of Heuristics, 2010, 16 : 139 - 165
[44] Multiobjective Discrete Artificial Bee Colony Algorithm for Multiobjective Permutation Flow Shop Scheduling Problem With Sequence Dependent Setup Times
Li, Xiangtao
Ma, Shijing
IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, 2017, 64 (02) : 149 - 165
[45] Job shop scheduling with setup times, deadlines and precedence constraints
Balas, Egon
Simonetti, Neil
Vazacopoulos, Alkis
JOURNAL OF SCHEDULING, 2008, 11 (04) : 253 - 262
[46] Job shop scheduling with setup times, deadlines and precedence constraints
Egon Balas
Neil Simonetti
Alkis Vazacopoulos
Journal of Scheduling, 2008, 11 : 253 - 262
[47] Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm
Miyata, Hugo Hissashi
Nagano, Marcelo Seido
JOURNAL OF MANUFACTURING SYSTEMS, 2021, 61 (61) : 592 - 612
[48] Modeling and optimization of the hybrid flow shop scheduling problem with sequence-dependent setup times
Xue, Huiting
Meng, Leilei
Duan, Peng
Zhang, Biao
Zou, Wenqiang
Sang, Hongyan
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2024, 15 (02) : 473 - 490
[49] Minimizing the Number of Tardy Jobs in Flow Shop Sequence Dependent Setup Times Scheduling Problem
Varmazyar, Mohsen
Salmasi, Nasser
MECHANICAL AND AEROSPACE ENGINEERING, PTS 1-7, 2012, 110-116 : 4063 - 4069
[50] Bi-criteria SDST hybrid flow shop scheduling with learning effect of setup times: water flow-like algorithm approach
Pargar, F.
Zandieh, M.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (10) : 2609 - 2623

← 1 2 3 4 5 →