Firefly-Inspired Algorithm for Job Shop Scheduling

Joss Miller-Todd; Kathleen Steinhöfel; Patrick Dennis Veenstra

doi:10.1007/978-3-319-98355-4_24

Firefly-Inspired Algorithm for Job Shop Scheduling

Joss Miller-Todd, Kathleen Steinhöfel, Patrick Dennis Veenstra

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

6 Citations (Scopus)

197 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 language	English
Title of host publication	Adventures Between Lower Bounds and Higher Altitudes
Subtitle of host publication	Essays Dedicated to Juraj Hromkovic on the Occasion of His 60th Birthday
Publisher	Springer
Pages	423-433
ISBN (Electronic)	9783319983554
ISBN (Print)	9783319983547
DOIs	https://doi.org/10.1007/978-3-319-98355-4_24
Publication status	Published - 2018

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	11011
ISSN (Print)	0302-9743

Keywords

job shop scheduling
firefly
simulated annealing

Access to Document

10.1007/978-3-319-98355-4_24

Firefly-Inspired Algorithm for_MILLER-TODD_Accepted2May2018_GREEN AAMAccepted author manuscript, 451 KB

Cite this

@inbook{1dbe031c1a304d348259077de7e6c314,

title = "Firefly-Inspired Algorithm for Job Shop Scheduling",

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.",

keywords = "job shop scheduling, firefly, simulated annealing",

author = "Joss Miller-Todd and Kathleen Steinh{\"o}fel and Veenstra, {Patrick Dennis}",

year = "2018",

doi = "10.1007/978-3-319-98355-4_24",

language = "English",

isbn = "9783319983547",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "423--433",

booktitle = "Adventures Between Lower Bounds and Higher Altitudes",

}

Firefly-Inspired Algorithm for Job Shop Scheduling. / Miller-Todd, Joss; Steinhöfel, Kathleen ; Veenstra, Patrick Dennis.
Adventures Between Lower Bounds and Higher Altitudes: Essays Dedicated to Juraj Hromkovic on the Occasion of His 60th Birthday. Springer, 2018. p. 423-433 (Lecture Notes in Computer Science; Vol. 11011).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Firefly-Inspired Algorithm for Job Shop Scheduling

AU - Miller-Todd, Joss

AU - Steinhöfel, Kathleen

AU - Veenstra, Patrick Dennis

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

KW - job shop scheduling

KW - firefly

KW - simulated annealing

U2 - 10.1007/978-3-319-98355-4_24

DO - 10.1007/978-3-319-98355-4_24

M3 - Chapter

SN - 9783319983547

T3 - Lecture Notes in Computer Science

SP - 423

EP - 433

BT - Adventures Between Lower Bounds and Higher Altitudes

PB - Springer

ER -

Firefly-Inspired Algorithm for Job Shop Scheduling

Abstract

Publication series

Keywords

Access to Document

Fingerprint

Cite this