Golden Ball Algorithm for solving Flow Shop Scheduling Problem

Author
Keywords
Abstract
The Flow Shop Scheduling Problem (FSSP) is notoriously NP-hard combinatorial optimization problem. The goal is to find a schedule that minimizes the makespan. This paper proposes an adaptation of a new approach called Golden Ball Algorithm (GBA). The proposed algorithm has been never tested with FSSP; it’s based on soccer concept to obtain the optimal solution. Numerical results are presented for 22 instances of OR- Library. The computational results indicate that this approach is practical for small OR-Library instances.
Year of Publication
2016
Journal
International Journal of Interactive Multimedia and Artificial Intelligence
Volume
4
Issue
Special Issue on Artificial Intelligence Underpinning
Number
1
Number of Pages
15-18
Date Published
09/2016
ISSN Number
1989-1660
Citation Key
URL
http://www.ijimai.org/JOURNAL/sites/default/files/files/2016/02/ijimai20164_1_3_pdf_32338.pdf
DOI
10.9781/ijimai.2016.413
Attachment