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...

Full description

Bibliographic Details
Main Authors: Fatima Sayoti, Mohammed Essaid Ri
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
_version_ 1819098386662424576
author Fatima Sayoti
Mohammed Essaid Ri
author_facet Fatima Sayoti
Mohammed Essaid Ri
author_sort Fatima Sayoti
collection DOAJ
description 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.
first_indexed 2024-12-22T00:30:10Z
format Article
id doaj.art-dddbebd5200045929d23c118dc179270
institution Directory Open Access Journal
issn 1989-1660
1989-1660
language English
last_indexed 2024-12-22T00:30:10Z
publishDate 2016-09-01
publisher Universidad Internacional de La Rioja (UNIR)
record_format Article
series International Journal of Interactive Multimedia and Artificial Intelligence
spelling doaj.art-dddbebd5200045929d23c118dc1792702022-12-21T18:44:58ZengUniversidad Internacional de La Rioja (UNIR)International Journal of Interactive Multimedia and Artificial Intelligence1989-16601989-16602016-09-0141151810.9781/ijimai.2016.414ijimai.2016.414Golden Ball Algorithm for solving Flow Shop Scheduling ProblemFatima SayotiMohammed Essaid RiThe 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.http://www.ijimai.org/journal/node/905Combinational OperationFlow ShopGolden Ball MetaheuristicMakespanScheduling
spellingShingle Fatima Sayoti
Mohammed Essaid Ri
Golden Ball Algorithm for solving Flow Shop Scheduling Problem
International Journal of Interactive Multimedia and Artificial Intelligence
Combinational Operation
Flow Shop
Golden Ball Metaheuristic
Makespan
Scheduling
title Golden Ball Algorithm for solving Flow Shop Scheduling Problem
title_full Golden Ball Algorithm for solving Flow Shop Scheduling Problem
title_fullStr Golden Ball Algorithm for solving Flow Shop Scheduling Problem
title_full_unstemmed Golden Ball Algorithm for solving Flow Shop Scheduling Problem
title_short Golden Ball Algorithm for solving Flow Shop Scheduling Problem
title_sort golden ball algorithm for solving flow shop scheduling problem
topic Combinational Operation
Flow Shop
Golden Ball Metaheuristic
Makespan
Scheduling
url http://www.ijimai.org/journal/node/905
work_keys_str_mv AT fatimasayoti goldenballalgorithmforsolvingflowshopschedulingproblem
AT mohammedessaidri goldenballalgorithmforsolvingflowshopschedulingproblem