01157nas a2200229   4500000000100000000000100001008004100002260001200043653001300055653001500068653001400083653003100097653002600128100001800154700002600172245006700198856009800265300001000363490000600373520053400379022001400913       2016                            d  c09/201610aMakespan10aScheduling10aFlow Shop10aCombinatorial Optimization10aGolden Ball Algorithm1 aFatima Sayoti1 aMohammed Essaid Riffi00aGolden Ball Algorithm for solving Flow Shop Scheduling Problem  uhttp://www.ijimai.org/JOURNAL/sites/default/files/files/2016/02/ijimai20164_1_3_pdf_32338.pdf  a15-180 v43 aThe 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.  a1989-1660