ACO-LS algorithm for solving no-wait flow shop scheduling problem

Ong Andre Wahyu Riyanto*, Budi Santosa

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Citations (Scopus)

Abstract

In this paper, we propose a metaheuristic approach for the no-wait flow shop scheduling problem with respect to the makespan criterion. In the literature, this problem is known NP-hard type. In the literature, several algorithms have been proposed to solve this problem. We propose a hybridization of ant colony optimization (ACO) algorithm with local search (LS) in order to solve this scheduling problem, and then we call this as ACO-LS algorithm. This local search technique contributes to improve the quality of the resulting solutions. In addition, the mechanism of insert-remove technique is developed to help the searching of solution escape from the local optimum. The proposed algorithm is tested with the 31 well-known flow shop benchmark instance. The computational results based on well-known benchmarks and statistical performance comparisons are also reported. It is shown that the proposed ACO-LS algorithm is more effective than hybrid differential evolution (HDE) algorithm [Qian B., et.al, Computer & Industrial Engineering, 2009].

Original languageEnglish
Title of host publicationIntelligence in the Era of Big Data - 4th International Conference on Soft Computing, Intelligent Systems and Information Technology, ICSIIT 2015, Proceedings
EditorsChi-Hung Chi, Rolly Intan, Henry N. Palit, Leo Willyanto Santoso
PublisherSpringer Verlag
Pages89-97
Number of pages9
ISBN (Electronic)9783662467411
DOIs
Publication statusPublished - 2015
Event4th International Conference on Soft Computing, Intelligent Systems and Information Technology, ICSIIT 2015 - Bali, Indonesia
Duration: 11 Mar 201514 Mar 2015

Publication series

NameCommunications in Computer and Information Science
Volume516
ISSN (Print)1865-0929

Conference

Conference4th International Conference on Soft Computing, Intelligent Systems and Information Technology, ICSIIT 2015
Country/TerritoryIndonesia
CityBali
Period11/03/1514/03/15

Keywords

  • Ant Colony Optimization
  • Local search
  • Makespan
  • Metaheuristic
  • No-wait flow shop scheduling

Fingerprint

Dive into the research topics of 'ACO-LS algorithm for solving no-wait flow shop scheduling problem'. Together they form a unique fingerprint.

Cite this