Optimization of Makespan in Job Shop Scheduling Problem by Golden Ball Algorithm

Fatima Sayoti, Mohammed Essaid Riffi, Halima Labani


Job shop scheduling problem (JSSP) is considered to belong to the class of NP-hard combinatorial optimization problem. Finding a solution to this problem is equivalent to solving different problems of various fields such as industry and logistics. The objective of this work is to optimize the makespan in JSSP using Golden Ball algorithm. In this paper we propose an efficient adaptation of Golden Ball algorithm to the JSSP. Numerical results are presented for 36 instances of OR-Library. The computational results show that the proposed adaptation is competitive when compared with other existing methods in the literature; it can solve the most of the benchmark instances.


Combinatorial Optimization; Metaheuristics; Golden Ball Metaheuristic; Job Shop Scheduling Problem; Makespan

Full Text:


DOI: http://doi.org/10.11591/ijeecs.v4.i3.pp542-547


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

shopify stats IJEECS visitor statistics