Golden Ball Algorithm for solving Flow Shop Scheduling Problem
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 FSS...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidad Internacional de La Rioja (UNIR)
2016-09-01
|
| Series: | International Journal of Interactive Multimedia and Artificial Intelligence |
| Subjects: | |
| Online Access: | http://www.ijimai.org/journal/node/905 |