Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect
In this paper, we study an unrelated parallel machine scheduling problem in which the jobs cause deterioration of the machines. This deterioration decreases the performance of the machines, and therefore, the processing times of the jobs are increased over time. The problem is to find the processing...
| Autores: | , |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versão publicada |
| Data de publicação: | 2017 |
| País: | Brasil |
| Recursos: | Universidade Federal de Viçosa (UFV) |
| Repositório: | LOCUS Repositório Institucional da UFV |
| Idioma: | inglês |
| OAI Identifier: | oai:locus.ufv.br:123456789/21699 |
| Acesso em linha: | https://doi.org/10.1016/j.endm.2017.03.008 http://www.locus.ufv.br/handle/123456789/21699 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Scheduling Unrelated parallel machines Deterioration effect Iterated greedy Variable neighborhood descent |
| Resumo: | In this paper, we study an unrelated parallel machine scheduling problem in which the jobs cause deterioration of the machines. This deterioration decreases the performance of the machines, and therefore, the processing times of the jobs are increased over time. The problem is to find the processing sequence of jobs on each machine in order to reduce the deterioration of the machines and consequently minimize the makespan. This problem is NP-hard when the number of machines is greater or equal than two, and hence we propose a heuristic based on the Iterated Greedy meta-heuristic coupled with a variant of the Variable Neighborhood Descent method that uses a random ordering of neighborhoods in local search phase. The performance of our heuristic, named IG-RVND, is compared with the state-of-the-art meta-heuristic proposed in the literature for the problem under study. The results show that the our heuristic outperform the existing algorithm by a significant margin. |
|---|