TY - JOUR
KW - Makespan
KW - Scheduling
KW - Flow Shop
KW - Combinatorial Optimization
KW - Golden Ball Algorithm
AU - Fatima Sayoti
AU - Mohammed Essaid Riffi
AB - 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.
IS - Special Issue on Artificial Intelligence Underpinning
M1 - 1
N2 - 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.
PY - 2016
SP - 15
EP - 18
T2 - International Journal of Interactive Multimedia and Artificial Intelligence
TI - Golden Ball Algorithm for solving Flow Shop Scheduling Problem
UR - http://www.ijimai.org/JOURNAL/sites/default/files/files/2016/02/ijimai20164_1_3_pdf_32338.pdf
VL - 4
SN - 1989-1660
ER -