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 条
  • [31] HYBRID GENETIC ALGORITHM FOR ASSEMBLY FLOW-SHOP SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SETUP AND TRANSPORTATION TIMES
    Dalfard, Vahid Majazi
    Ardakani, Allahyar
    Banihashemi, Tak Nazalsadat
    TEHNICKI VJESNIK-TECHNICAL GAZETTE, 2011, 18 (04): : 497 - 504
  • [32] Approximation algorithms for two-machine flow shop scheduling with batch setup times
    Chen, B
    Potts, CN
    Strusevich, VA
    MATHEMATICAL PROGRAMMING, 1998, 82 (1-2) : 255 - 271
  • [33] Approximation algorithms for two-machine flow shop scheduling with batch setup times
    Bo Chen
    Chris N. Potts
    Vitaly A. Strusevich
    Mathematical Programming, 1998, 82 : 255 - 271
  • [34] 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
  • [35] Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times
    Takano, Mauricio Iwama
    Nagano, Marcelo Seido
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2019, 10 (01) : 37 - 50
  • [36] Flow shop no-wait scheduling with sequence dependeent setup times and release dates
    Bianco, L
    Dell'Olmo, P
    Giordani, S
    INFOR, 1999, 37 (01) : 3 - 19
  • [37] A discrete differential evolution algorithm for flow shop group scheduling problem with sequence-dependent setup and transportation times
    Shuaipeng Yuan
    Tieke Li
    Bailin Wang
    Journal of Intelligent Manufacturing, 2021, 32 : 427 - 439
  • [38] Approximation algorithms for two-machine flow shop scheduling with batch setup times
    Chen, Bo
    Potts, Chris N.
    Strusevich, Vitaly A.
    Mathematical Programming, Series B, 1998, 82 (1-2): : 255 - 271
  • [39] An MBO Algorithm for a Flow Shop Problem with Sequence-Dependent Setup Times
    Sioud, Aymen
    Gagne, Caroline
    PROCEEDINGS OF THE 2016 12TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA), 2016, : 2471 - 2474
  • [40] An Effective Hybrid Algorithm for Permutation Flow Shop Scheduling Problem with Setup Time
    Peng, Kunkun
    Wen, Long
    Li, Ran
    Gao, Liang
    Li, Xinyu
    51ST CIRP CONFERENCE ON MANUFACTURING SYSTEMS, 2018, 72 : 1288 - 1292
12345