Hybrid metaheuristic to solve job sequencing problem

Gustavo Erick Anaya - Fuentes, Héctor Rivera - Gómez, Oscar Montaño-Arango, José Ramón Corona-Armenta, Enrique Martínez-Muñoz

Abstract


In this article, the job shop scheduling problem was solved, which is considered as an NP - Hard problem, so it is difficult to solve. The proposed algorithm consists in the combination and adaptation of the nearest neighbor meta heuristics and iterated local search (ILS) to find optimal solutions. The proposed algorithm was evaluated by comparing the results with those presented in different instances and sizes of the literature. The results of the proposed method were close in high percentages to the best re sults and averages obtained by other methods in the literature and in some cases, they were improved. The above represents the feasibility of a new combination of efficient methods in solving task scheduling problems.


Keywords


Closest neighbor; Iterated local search; Job shop scheduling; Makespan; Metaheuristics

Full Text:

PDF


DOI: http://doi.org/10.11591/ijeecs.v27.i1.pp496-503

Refbacks

  • There are currently no refbacks.


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

Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics