Exact and heuristic algorithms for scheduling problems

Detalhes bibliográficos
Autor(a) principal: Kramer, Arthur Harry Frederico Ribeiro
Data de Publicação: 2020
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UFRN
Texto Completo: https://repositorio.ufrn.br/handle/123456789/31049
Resumo: This is a summary of the author’s Ph.D. thesis supervised by Manuel Iori and defended on March 22, 2019 at the Università degli Studi di Modena e Reggio Emilia. This thesis is written in English and is available from the author upon request at arthur.kramer@unimore.it and can be downloaded from https://morethesis.unimore. it/theses/available/etd-12282018-001820/. This research was funded by Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq/Brazil) under Grant GDE 234814/2014-4
id UFRN_666d89278b093d97997cfe4e3de51ff1
oai_identifier_str oai:https://repositorio.ufrn.br:123456789/31049
network_acronym_str UFRN
network_name_str Repositório Institucional da UFRN
repository_id_str
spelling Kramer, Arthur Harry Frederico Ribeiro2020-12-17T21:12:17Z2020-12-17T21:12:17Z2020KRAMER, Arthur. Exact and heuristic algorithms for scheduling problems. 4OR-A Quarterly Journal of Operations Research, v. 18, p. 123-124, 2020. Disponível em: https://link.springer.com/article/10.1007/s10288-019-00408-y Acesso em: 10 dez 2020. https://doi.org/10.1007/s10288-019-00408-y.1619-45001614-2411https://repositorio.ufrn.br/handle/123456789/3104910.1007/s10288-019-00408-ySpringerAttribution 3.0 Brazilhttp://creativecommons.org/licenses/by/3.0/br/info:eu-repo/semantics/openAccessHeuristic algorithmsScheduling problemsExact and heuristic algorithms for scheduling problemsinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleThis is a summary of the author’s Ph.D. thesis supervised by Manuel Iori and defended on March 22, 2019 at the Università degli Studi di Modena e Reggio Emilia. This thesis is written in English and is available from the author upon request at arthur.kramer@unimore.it and can be downloaded from https://morethesis.unimore. it/theses/available/etd-12282018-001820/. This research was funded by Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq/Brazil) under Grant GDE 234814/2014-4engreponame:Repositório Institucional da UFRNinstname:Universidade Federal do Rio Grande do Norte (UFRN)instacron:UFRNORIGINALExactAndHeuristicAlgorithms_Kramer_2020.pdfExactAndHeuristicAlgorithms_Kramer_2020.pdfapplication/pdf111870https://repositorio.ufrn.br/bitstream/123456789/31049/1/ExactAndHeuristicAlgorithms_Kramer_2020.pdf5bc0c3a89b8dfc93adc9cd7413be816aMD51CC-LICENSElicense_rdflicense_rdfapplication/rdf+xml; charset=utf-8914https://repositorio.ufrn.br/bitstream/123456789/31049/2/license_rdf4d2950bda3d176f570a9f8b328dfbbefMD52LICENSElicense.txtlicense.txttext/plain; charset=utf-81484https://repositorio.ufrn.br/bitstream/123456789/31049/3/license.txte9597aa2854d128fd968be5edc8a28d9MD53TEXTExactAndHeuristicAlgorithms_Kramer_2020.pdf.txtExactAndHeuristicAlgorithms_Kramer_2020.pdf.txtExtracted texttext/plain5123https://repositorio.ufrn.br/bitstream/123456789/31049/4/ExactAndHeuristicAlgorithms_Kramer_2020.pdf.txt12caeae62857490850a5b838890fa82aMD54THUMBNAILExactAndHeuristicAlgorithms_Kramer_2020.pdf.jpgExactAndHeuristicAlgorithms_Kramer_2020.pdf.jpgGenerated Thumbnailimage/jpeg1592https://repositorio.ufrn.br/bitstream/123456789/31049/5/ExactAndHeuristicAlgorithms_Kramer_2020.pdf.jpg9a39b66653bbb1d6b6a9cc3e855a11ceMD55123456789/310492020-12-20 04:59:56.248oai:https://repositorio.ufrn.br:123456789/31049Tk9OLUVYQ0xVU0lWRSBESVNUUklCVVRJT04gTElDRU5TRQoKCkJ5IHNpZ25pbmcgYW5kIGRlbGl2ZXJpbmcgdGhpcyBsaWNlbnNlLCBNci4gKGF1dGhvciBvciBjb3B5cmlnaHQgaG9sZGVyKToKCgphKSBHcmFudHMgdGhlIFVuaXZlcnNpZGFkZSBGZWRlcmFsIFJpbyBHcmFuZGUgZG8gTm9ydGUgdGhlIG5vbi1leGNsdXNpdmUgcmlnaHQgb2YKcmVwcm9kdWNlLCBjb252ZXJ0IChhcyBkZWZpbmVkIGJlbG93KSwgY29tbXVuaWNhdGUgYW5kIC8gb3IKZGlzdHJpYnV0ZSB0aGUgZGVsaXZlcmVkIGRvY3VtZW50IChpbmNsdWRpbmcgYWJzdHJhY3QgLyBhYnN0cmFjdCkgaW4KZGlnaXRhbCBvciBwcmludGVkIGZvcm1hdCBhbmQgaW4gYW55IG1lZGl1bS4KCmIpIERlY2xhcmVzIHRoYXQgdGhlIGRvY3VtZW50IHN1Ym1pdHRlZCBpcyBpdHMgb3JpZ2luYWwgd29yaywgYW5kIHRoYXQKeW91IGhhdmUgdGhlIHJpZ2h0IHRvIGdyYW50IHRoZSByaWdodHMgY29udGFpbmVkIGluIHRoaXMgbGljZW5zZS4gRGVjbGFyZXMKdGhhdCB0aGUgZGVsaXZlcnkgb2YgdGhlIGRvY3VtZW50IGRvZXMgbm90IGluZnJpbmdlLCBhcyBmYXIgYXMgaXQgaXMKdGhlIHJpZ2h0cyBvZiBhbnkgb3RoZXIgcGVyc29uIG9yIGVudGl0eS4KCmMpIElmIHRoZSBkb2N1bWVudCBkZWxpdmVyZWQgY29udGFpbnMgbWF0ZXJpYWwgd2hpY2ggZG9lcyBub3QKcmlnaHRzLCBkZWNsYXJlcyB0aGF0IGl0IGhhcyBvYnRhaW5lZCBhdXRob3JpemF0aW9uIGZyb20gdGhlIGhvbGRlciBvZiB0aGUKY29weXJpZ2h0IHRvIGdyYW50IHRoZSBVbml2ZXJzaWRhZGUgRmVkZXJhbCBkbyBSaW8gR3JhbmRlIGRvIE5vcnRlIHRoZSByaWdodHMgcmVxdWlyZWQgYnkgdGhpcyBsaWNlbnNlLCBhbmQgdGhhdCB0aGlzIG1hdGVyaWFsIHdob3NlIHJpZ2h0cyBhcmUgb2YKdGhpcmQgcGFydGllcyBpcyBjbGVhcmx5IGlkZW50aWZpZWQgYW5kIHJlY29nbml6ZWQgaW4gdGhlIHRleHQgb3IKY29udGVudCBvZiB0aGUgZG9jdW1lbnQgZGVsaXZlcmVkLgoKSWYgdGhlIGRvY3VtZW50IHN1Ym1pdHRlZCBpcyBiYXNlZCBvbiBmdW5kZWQgb3Igc3VwcG9ydGVkIHdvcmsKYnkgYW5vdGhlciBpbnN0aXR1dGlvbiBvdGhlciB0aGFuIHRoZSBVbml2ZXJzaWRhZGUgRmVkZXJhbCBkbyBSaW8gR3JhbmRlIGRvIE5vcnRlLCBkZWNsYXJlcyB0aGF0IGl0IGhhcyBmdWxmaWxsZWQgYW55IG9ibGlnYXRpb25zIHJlcXVpcmVkIGJ5IHRoZSByZXNwZWN0aXZlIGFncmVlbWVudCBvciBhZ3JlZW1lbnQuCgpUaGUgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZG8gUmlvIEdyYW5kZSBkbyBOb3J0ZSB3aWxsIGNsZWFybHkgaWRlbnRpZnkgaXRzIG5hbWUgKHMpIGFzIHRoZSBhdXRob3IgKHMpIG9yIGhvbGRlciAocykgb2YgdGhlIGRvY3VtZW50J3MgcmlnaHRzCmRlbGl2ZXJlZCwgYW5kIHdpbGwgbm90IG1ha2UgYW55IGNoYW5nZXMsIG90aGVyIHRoYW4gdGhvc2UgcGVybWl0dGVkIGJ5CnRoaXMgbGljZW5zZQo=Repositório de PublicaçõesPUBhttp://repositorio.ufrn.br/oai/opendoar:2020-12-20T07:59:56Repositório Institucional da UFRN - Universidade Federal do Rio Grande do Norte (UFRN)false
dc.title.pt_BR.fl_str_mv Exact and heuristic algorithms for scheduling problems
title Exact and heuristic algorithms for scheduling problems
spellingShingle Exact and heuristic algorithms for scheduling problems
Kramer, Arthur Harry Frederico Ribeiro
Heuristic algorithms
Scheduling problems
title_short Exact and heuristic algorithms for scheduling problems
title_full Exact and heuristic algorithms for scheduling problems
title_fullStr Exact and heuristic algorithms for scheduling problems
title_full_unstemmed Exact and heuristic algorithms for scheduling problems
title_sort Exact and heuristic algorithms for scheduling problems
author Kramer, Arthur Harry Frederico Ribeiro
author_facet Kramer, Arthur Harry Frederico Ribeiro
author_role author
dc.contributor.author.fl_str_mv Kramer, Arthur Harry Frederico Ribeiro
dc.subject.por.fl_str_mv Heuristic algorithms
Scheduling problems
topic Heuristic algorithms
Scheduling problems
description This is a summary of the author’s Ph.D. thesis supervised by Manuel Iori and defended on March 22, 2019 at the Università degli Studi di Modena e Reggio Emilia. This thesis is written in English and is available from the author upon request at arthur.kramer@unimore.it and can be downloaded from https://morethesis.unimore. it/theses/available/etd-12282018-001820/. This research was funded by Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq/Brazil) under Grant GDE 234814/2014-4
publishDate 2020
dc.date.accessioned.fl_str_mv 2020-12-17T21:12:17Z
dc.date.available.fl_str_mv 2020-12-17T21:12:17Z
dc.date.issued.fl_str_mv 2020
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.citation.fl_str_mv KRAMER, Arthur. Exact and heuristic algorithms for scheduling problems. 4OR-A Quarterly Journal of Operations Research, v. 18, p. 123-124, 2020. Disponível em: https://link.springer.com/article/10.1007/s10288-019-00408-y Acesso em: 10 dez 2020. https://doi.org/10.1007/s10288-019-00408-y.
dc.identifier.uri.fl_str_mv https://repositorio.ufrn.br/handle/123456789/31049
dc.identifier.issn.none.fl_str_mv 1619-4500
1614-2411
dc.identifier.doi.none.fl_str_mv 10.1007/s10288-019-00408-y
identifier_str_mv KRAMER, Arthur. Exact and heuristic algorithms for scheduling problems. 4OR-A Quarterly Journal of Operations Research, v. 18, p. 123-124, 2020. Disponível em: https://link.springer.com/article/10.1007/s10288-019-00408-y Acesso em: 10 dez 2020. https://doi.org/10.1007/s10288-019-00408-y.
1619-4500
1614-2411
10.1007/s10288-019-00408-y
url https://repositorio.ufrn.br/handle/123456789/31049
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv Attribution 3.0 Brazil
http://creativecommons.org/licenses/by/3.0/br/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Attribution 3.0 Brazil
http://creativecommons.org/licenses/by/3.0/br/
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFRN
instname:Universidade Federal do Rio Grande do Norte (UFRN)
instacron:UFRN
instname_str Universidade Federal do Rio Grande do Norte (UFRN)
instacron_str UFRN
institution UFRN
reponame_str Repositório Institucional da UFRN
collection Repositório Institucional da UFRN
bitstream.url.fl_str_mv https://repositorio.ufrn.br/bitstream/123456789/31049/1/ExactAndHeuristicAlgorithms_Kramer_2020.pdf
https://repositorio.ufrn.br/bitstream/123456789/31049/2/license_rdf
https://repositorio.ufrn.br/bitstream/123456789/31049/3/license.txt
https://repositorio.ufrn.br/bitstream/123456789/31049/4/ExactAndHeuristicAlgorithms_Kramer_2020.pdf.txt
https://repositorio.ufrn.br/bitstream/123456789/31049/5/ExactAndHeuristicAlgorithms_Kramer_2020.pdf.jpg
bitstream.checksum.fl_str_mv 5bc0c3a89b8dfc93adc9cd7413be816a
4d2950bda3d176f570a9f8b328dfbbef
e9597aa2854d128fd968be5edc8a28d9
12caeae62857490850a5b838890fa82a
9a39b66653bbb1d6b6a9cc3e855a11ce
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFRN - Universidade Federal do Rio Grande do Norte (UFRN)
repository.mail.fl_str_mv
_version_ 1814832891056619520

Registros relacionados