Firefly-Inspired Algorithm for Job Shop Scheduling

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

6 Citations (Scopus)
176 Downloads (Pure)

Abstract

Current research strongly suggests that hybrid local search algorithms are more effective than heuristics based on homogenous methods. Accordingly, this paper presents a new hybrid method of Simulated Annealing and Firefly Algorithm [SAFA] for the Job Shop Scheduling Problem (JSSP) with the objective of minimising the makespan. We provide an experimental analysis of its performance based on a set of established benchmarks. Simulated Annealing [SA] continues to be a viable approach in identifying optimal and near optimal makespans for the JSSP. Similarly, recent deployments of the Firefly Algorithm [FA] have delineated its effectiveness for solving combinatorial optimisation problems efficiently. Therefore, the hybrid algorithm in question aims to combine the acclamatory strengths of SA and FA while overcoming their respective deficiencies.
Original languageEnglish
Title of host publicationAdventures Between Lower Bounds and Higher Altitudes
Subtitle of host publicationEssays Dedicated to Juraj Hromkovic on the Occasion of His 60th Birthday
PublisherSpringer
Pages423-433
ISBN (Electronic)9783319983554
ISBN (Print)9783319983547
DOIs
Publication statusPublished - 2018

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume11011
ISSN (Print)0302-9743

Keywords

  • job shop scheduling
  • firefly
  • simulated annealing

Fingerprint

Dive into the research topics of 'Firefly-Inspired Algorithm for Job Shop Scheduling'. Together they form a unique fingerprint.

Cite this