We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
UM ALGORITMO HÍBRIDO BUSCA TABU/ILS PARA O PROBLEMA DE SEQUENCIAMENTO DA PRODUÇÃO EM AMBIENTE OPEN SHOP.
- Authors
Lopes Costa Lima, Vitor Hugo; de Athayde Prata, Bruno
- Abstract
The open shop scheduling problem is a production environment in which the jobs are processed in m machines where all the machines can process any of the n jobs and each machine presents a specific processing time for a given job. Since the OSSP is NP-complete, a tabu search/iterated local search (ILS) metaheuristic is proposed. We carried out computational experiments on 140 literature problem instances in order to test the performance of the proposed algorithm. The wellknown priority rules LPT, SPT, LAPT and LTRPOM were evaluated as the initial solution for the proposed meta-heuristic. The objective function adopted was minimizing the makespan, and we used the relative deviation as performance criteria. Computational results point to a very well performance of the proposed metaheuristic for the tested instances.
- Subjects
PRODUCTION scheduling; RETAIL store openings; ALGORITHMS; METAHEURISTIC algorithms; COMBINATORIAL optimization; TABOO; ONLINE algorithms
- Publication
Exacta, 2021, Vol 19, Issue 4, p728
- ISSN
1678-5428
- Publication type
Article
- DOI
10.5585/exactaep.2021.11626