Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect
Autor(a) principal: | |
---|---|
Data de Publicação: | 2017 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | LOCUS Repositório Institucional da UFV |
Texto Completo: | https://doi.org/10.1016/j.endm.2017.03.008 http://www.locus.ufv.br/handle/123456789/21699 |
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. |
id |
UFV_373639b6ccff6602134713241b6a55c2 |
---|---|
oai_identifier_str |
oai:locus.ufv.br:123456789/21699 |
network_acronym_str |
UFV |
network_name_str |
LOCUS Repositório Institucional da UFV |
repository_id_str |
2145 |
spelling |
Santos, Vívian L. AguiarArroyo, José Elias C.2018-09-09T22:18:16Z2018-09-09T22:18:16Z2017-04-141571-0653https://doi.org/10.1016/j.endm.2017.03.008http://www.locus.ufv.br/handle/123456789/21699In 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.engElectronic Notes in Discrete MathematicsVolume 58, Pages 55-62, April 2017Elsevier B.V.info:eu-repo/semantics/openAccessSchedulingUnrelated parallel machinesDeterioration effectIterated greedyVariable neighborhood descentIterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effectinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfreponame:LOCUS Repositório Institucional da UFVinstname:Universidade Federal de Viçosa (UFV)instacron:UFVORIGINALartigo.pdfartigo.pdfTexto completoapplication/pdf248503https://locus.ufv.br//bitstream/123456789/21699/1/artigo.pdfa9c308d5e71bebf77afc6a259f6a0303MD51LICENSElicense.txtlicense.txttext/plain; charset=utf-81748https://locus.ufv.br//bitstream/123456789/21699/2/license.txt8a4605be74aa9ea9d79846c1fba20a33MD52THUMBNAILartigo.pdf.jpgartigo.pdf.jpgIM Thumbnailimage/jpeg4868https://locus.ufv.br//bitstream/123456789/21699/3/artigo.pdf.jpgbfeab9090e5dea770a870c33fe0c431aMD53123456789/216992018-09-09 23:00:44.266oai:locus.ufv.br:123456789/21699Tk9URTogUExBQ0UgWU9VUiBPV04gTElDRU5TRSBIRVJFClRoaXMgc2FtcGxlIGxpY2Vuc2UgaXMgcHJvdmlkZWQgZm9yIGluZm9ybWF0aW9uYWwgcHVycG9zZXMgb25seS4KCk5PTi1FWENMVVNJVkUgRElTVFJJQlVUSU9OIExJQ0VOU0UKCkJ5IHNpZ25pbmcgYW5kIHN1Ym1pdHRpbmcgdGhpcyBsaWNlbnNlLCB5b3UgKHRoZSBhdXRob3Iocykgb3IgY29weXJpZ2h0Cm93bmVyKSBncmFudHMgdG8gRFNwYWNlIFVuaXZlcnNpdHkgKERTVSkgdGhlIG5vbi1leGNsdXNpdmUgcmlnaHQgdG8gcmVwcm9kdWNlLAp0cmFuc2xhdGUgKGFzIGRlZmluZWQgYmVsb3cpLCBhbmQvb3IgZGlzdHJpYnV0ZSB5b3VyIHN1Ym1pc3Npb24gKGluY2x1ZGluZwp0aGUgYWJzdHJhY3QpIHdvcmxkd2lkZSBpbiBwcmludCBhbmQgZWxlY3Ryb25pYyBmb3JtYXQgYW5kIGluIGFueSBtZWRpdW0sCmluY2x1ZGluZyBidXQgbm90IGxpbWl0ZWQgdG8gYXVkaW8gb3IgdmlkZW8uCgpZb3UgYWdyZWUgdGhhdCBEU1UgbWF5LCB3aXRob3V0IGNoYW5naW5nIHRoZSBjb250ZW50LCB0cmFuc2xhdGUgdGhlCnN1Ym1pc3Npb24gdG8gYW55IG1lZGl1bSBvciBmb3JtYXQgZm9yIHRoZSBwdXJwb3NlIG9mIHByZXNlcnZhdGlvbi4KCllvdSBhbHNvIGFncmVlIHRoYXQgRFNVIG1heSBrZWVwIG1vcmUgdGhhbiBvbmUgY29weSBvZiB0aGlzIHN1Ym1pc3Npb24gZm9yCnB1cnBvc2VzIG9mIHNlY3VyaXR5LCBiYWNrLXVwIGFuZCBwcmVzZXJ2YXRpb24uCgpZb3UgcmVwcmVzZW50IHRoYXQgdGhlIHN1Ym1pc3Npb24gaXMgeW91ciBvcmlnaW5hbCB3b3JrLCBhbmQgdGhhdCB5b3UgaGF2ZQp0aGUgcmlnaHQgdG8gZ3JhbnQgdGhlIHJpZ2h0cyBjb250YWluZWQgaW4gdGhpcyBsaWNlbnNlLiBZb3UgYWxzbyByZXByZXNlbnQKdGhhdCB5b3VyIHN1Ym1pc3Npb24gZG9lcyBub3QsIHRvIHRoZSBiZXN0IG9mIHlvdXIga25vd2xlZGdlLCBpbmZyaW5nZSB1cG9uCmFueW9uZSdzIGNvcHlyaWdodC4KCklmIHRoZSBzdWJtaXNzaW9uIGNvbnRhaW5zIG1hdGVyaWFsIGZvciB3aGljaCB5b3UgZG8gbm90IGhvbGQgY29weXJpZ2h0LAp5b3UgcmVwcmVzZW50IHRoYXQgeW91IGhhdmUgb2J0YWluZWQgdGhlIHVucmVzdHJpY3RlZCBwZXJtaXNzaW9uIG9mIHRoZQpjb3B5cmlnaHQgb3duZXIgdG8gZ3JhbnQgRFNVIHRoZSByaWdodHMgcmVxdWlyZWQgYnkgdGhpcyBsaWNlbnNlLCBhbmQgdGhhdApzdWNoIHRoaXJkLXBhcnR5IG93bmVkIG1hdGVyaWFsIGlzIGNsZWFybHkgaWRlbnRpZmllZCBhbmQgYWNrbm93bGVkZ2VkCndpdGhpbiB0aGUgdGV4dCBvciBjb250ZW50IG9mIHRoZSBzdWJtaXNzaW9uLgoKSUYgVEhFIFNVQk1JU1NJT04gSVMgQkFTRUQgVVBPTiBXT1JLIFRIQVQgSEFTIEJFRU4gU1BPTlNPUkVEIE9SIFNVUFBPUlRFRApCWSBBTiBBR0VOQ1kgT1IgT1JHQU5JWkFUSU9OIE9USEVSIFRIQU4gRFNVLCBZT1UgUkVQUkVTRU5UIFRIQVQgWU9VIEhBVkUKRlVMRklMTEVEIEFOWSBSSUdIVCBPRiBSRVZJRVcgT1IgT1RIRVIgT0JMSUdBVElPTlMgUkVRVUlSRUQgQlkgU1VDSApDT05UUkFDVCBPUiBBR1JFRU1FTlQuCgpEU1Ugd2lsbCBjbGVhcmx5IGlkZW50aWZ5IHlvdXIgbmFtZShzKSBhcyB0aGUgYXV0aG9yKHMpIG9yIG93bmVyKHMpIG9mIHRoZQpzdWJtaXNzaW9uLCBhbmQgd2lsbCBub3QgbWFrZSBhbnkgYWx0ZXJhdGlvbiwgb3RoZXIgdGhhbiBhcyBhbGxvd2VkIGJ5IHRoaXMKbGljZW5zZSwgdG8geW91ciBzdWJtaXNzaW9uLgo=Repositório InstitucionalPUBhttps://www.locus.ufv.br/oai/requestfabiojreis@ufv.bropendoar:21452018-09-10T02:00:44LOCUS Repositório Institucional da UFV - Universidade Federal de Viçosa (UFV)false |
dc.title.en.fl_str_mv |
Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect |
title |
Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect |
spellingShingle |
Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect Santos, Vívian L. Aguiar Scheduling Unrelated parallel machines Deterioration effect Iterated greedy Variable neighborhood descent |
title_short |
Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect |
title_full |
Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect |
title_fullStr |
Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect |
title_full_unstemmed |
Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect |
title_sort |
Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect |
author |
Santos, Vívian L. Aguiar |
author_facet |
Santos, Vívian L. Aguiar Arroyo, José Elias C. |
author_role |
author |
author2 |
Arroyo, José Elias C. |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Santos, Vívian L. Aguiar Arroyo, José Elias C. |
dc.subject.pt-BR.fl_str_mv |
Scheduling Unrelated parallel machines Deterioration effect Iterated greedy Variable neighborhood descent |
topic |
Scheduling Unrelated parallel machines Deterioration effect Iterated greedy Variable neighborhood descent |
description |
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. |
publishDate |
2017 |
dc.date.issued.fl_str_mv |
2017-04-14 |
dc.date.accessioned.fl_str_mv |
2018-09-09T22:18:16Z |
dc.date.available.fl_str_mv |
2018-09-09T22:18:16Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://doi.org/10.1016/j.endm.2017.03.008 http://www.locus.ufv.br/handle/123456789/21699 |
dc.identifier.issn.none.fl_str_mv |
1571-0653 |
identifier_str_mv |
1571-0653 |
url |
https://doi.org/10.1016/j.endm.2017.03.008 http://www.locus.ufv.br/handle/123456789/21699 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.ispartofseries.pt-BR.fl_str_mv |
Volume 58, Pages 55-62, April 2017 |
dc.rights.driver.fl_str_mv |
Elsevier B.V. info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Elsevier B.V. |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Electronic Notes in Discrete Mathematics |
publisher.none.fl_str_mv |
Electronic Notes in Discrete Mathematics |
dc.source.none.fl_str_mv |
reponame:LOCUS Repositório Institucional da UFV instname:Universidade Federal de Viçosa (UFV) instacron:UFV |
instname_str |
Universidade Federal de Viçosa (UFV) |
instacron_str |
UFV |
institution |
UFV |
reponame_str |
LOCUS Repositório Institucional da UFV |
collection |
LOCUS Repositório Institucional da UFV |
bitstream.url.fl_str_mv |
https://locus.ufv.br//bitstream/123456789/21699/1/artigo.pdf https://locus.ufv.br//bitstream/123456789/21699/2/license.txt https://locus.ufv.br//bitstream/123456789/21699/3/artigo.pdf.jpg |
bitstream.checksum.fl_str_mv |
a9c308d5e71bebf77afc6a259f6a0303 8a4605be74aa9ea9d79846c1fba20a33 bfeab9090e5dea770a870c33fe0c431a |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 |
repository.name.fl_str_mv |
LOCUS Repositório Institucional da UFV - Universidade Federal de Viçosa (UFV) |
repository.mail.fl_str_mv |
fabiojreis@ufv.br |
_version_ |
1801213095411974144 |