Mostrar el registro sencillo del ítem
Golden Ball Algorithm for solving Flow Shop Scheduling Problem
| dc.contributor.author | Sayoti, Fatima | |
| dc.contributor.author | Essaid Riffi, Mohammed | |
| dc.date | 2016-09 | |
| dc.date.accessioned | 2021-07-07T09:38:36Z | |
| dc.date.available | 2021-07-07T09:38:36Z | |
| dc.identifier.issn | 1989-1660 | |
| dc.identifier.uri | https://reunir.unir.net/handle/123456789/11567 | |
| dc.description.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. | es_ES |
| dc.language.iso | eng | es_ES |
| dc.publisher | International Journal of Interactive Multimedia and Artificial Intelligence (IJIMAI) | es_ES |
| dc.relation.ispartofseries | ;vol. 4, nº 1 | |
| dc.relation.uri | https://ijimai.org/journal/bibcite/reference/2521 | es_ES |
| dc.rights | openAccess | es_ES |
| dc.subject | makespan | es_ES |
| dc.subject | scheduling | es_ES |
| dc.subject | flow shop | es_ES |
| dc.subject | combinatorial optimization | es_ES |
| dc.subject | golden ball algorithm | es_ES |
| dc.subject | IJIMAI | es_ES |
| dc.title | Golden Ball Algorithm for solving Flow Shop Scheduling Problem | es_ES |
| dc.type | article | es_ES |
| reunir.tag | ~IJIMAI | es_ES |
| dc.identifier.doi | http://doi.org/10.9781/ijimai.2016.413 |
