Golden Ball Algorithm for solving Flow Shop Scheduling Problem

dc.creatorSayoti, Fatima
dc.creatorEssaid Riffi, Mohammed
dc.date.accessioned2021-07-07T09:38:36Z
dc.date.accessioned2023-03-07T19:31:48Z
dc.date.available2021-07-07T09:38:36Z
dc.date.available2023-03-07T19:31:48Z
dc.date.created2021-07-07T09:38:36Z
dc.identifier1989-1660
dc.identifierhttps://reunir.unir.net/handle/123456789/11567
dc.identifierhttp://doi.org/10.9781/ijimai.2016.413
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5905883
dc.description.abstractThe 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.
dc.languageeng
dc.publisherInternational Journal of Interactive Multimedia and Artificial Intelligence (IJIMAI)
dc.relation;vol. 4, nº 1
dc.relationhttps://ijimai.org/journal/bibcite/reference/2521
dc.rightsopenAccess
dc.subjectmakespan
dc.subjectscheduling
dc.subjectflow shop
dc.subjectcombinatorial optimization
dc.subjectgolden ball algorithm
dc.subjectIJIMAI
dc.titleGolden Ball Algorithm for solving Flow Shop Scheduling Problem
dc.typearticle


Este ítem pertenece a la siguiente institución