Mixed-integer linear programming based approaches for the resource constrained project scheduling problem.

Detalhes bibliográficos
Autor(a) principal: Araujo, Janniele Aparecida Soares
Data de Publicação: 2019
Tipo de documento: Tese
Idioma: eng
Título da fonte: Repositório Institucional da UFOP
Texto Completo: http://www.repositorio.ufop.br/handle/123456789/11879
Resumo: Programa de Pós-Graduação em Ciência da Computação. Departamento de Ciência da Computação, Instituto de Ciências Exatas e Biológicas, Universidade Federal de Ouro Preto.
id UFOP_45c68ecc0a91664337456f015ad782c3
oai_identifier_str oai:localhost:123456789/11879
network_acronym_str UFOP
network_name_str Repositório Institucional da UFOP
repository_id_str 3233
spelling Araujo, Janniele Aparecida SoaresSantos, Haroldo GambiniBarboza, Eduardo UchoaSouza, Marcone Jamilson FreitasJena, Sanjay DominikToffolo, Túlio Ângelo MachadoSantos, Haroldo Gambini2020-01-09T16:42:21Z2020-01-09T16:42:21Z2019ARAUJO, Janniele Aparecida Soares. Mixed-integer linear programming based approaches for the resource constrained project scheduling problem. 2019. 96 f. Tese (Doutorado em Ciência da Computação) - Instituto de Ciências Exatas e Biológicas, Universidade Federal de Ouro Preto, Ouro Preto, 2019.http://www.repositorio.ufop.br/handle/123456789/11879Programa de Pós-Graduação em Ciência da Computação. Departamento de Ciência da Computação, Instituto de Ciências Exatas e Biológicas, Universidade Federal de Ouro Preto.Resource Constrained Project Scheduling Problems (RCPSPs) without preemption are well-known NP-hard combinatorial optimization problems. A feasible RCPSP solution consists of a time-ordered schedule of jobs with corresponding execution modes, respecting precedence and resources constraints. First, in this thesis, we provide improved upper bounds for many hard instances from the literature by using methods based on Stochastic Local Search (SLS). As the most contribution part of this work, we propose a cutting plane algorithm to separate five different cut families, as well as a new preprocessing routine to strengthen resource-related constraints. New lifted versions of the well-known precedence and cover inequalities are employed. At each iteration, a dense conict graph is built considering feasibility and optimality conditions to separate cliques, odd-holes and strengthened Chvátal-Gomory cuts. The proposed strategies considerably improve the linear relaxation bounds, allowing a state-of-the-art mixed-integer linear programming solver to nd provably optimal solutions for 754 previously open instances of different variants of the RCPSPs, which was not possible using the original linear programming formulations.Autorização concedida ao Repositório Institucional da UFOP pelo(a) autor(a) em 20/12/2019 com as seguintes condições: disponível sob Licença Creative Commons 4.0 que permite copiar, distribuir e transmitir o trabalho desde que sejam citados o autor e o licenciante. Não permite o uso para fins comerciais nem a adaptação.info:eu-repo/semantics/openAccessFinanciamento de projetosOrçamento-programaProgramação linearMixed-integer linear programming based approaches for the resource constrained project scheduling problem.info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesisengreponame:Repositório Institucional da UFOPinstname:Universidade Federal de Ouro Preto (UFOP)instacron:UFOPLICENSElicense.txtlicense.txttext/plain; charset=utf-8924http://www.repositorio.ufop.br/bitstream/123456789/11879/5/license.txt62604f8d955274beb56c80ce1ee5dcaeMD55CC-LICENSElicense_urllicense_urltext/plain; charset=utf-849http://www.repositorio.ufop.br/bitstream/123456789/11879/2/license_url4afdbb8c545fd630ea7db775da747b2fMD52license_textlicense_texttext/html; charset=utf-80http://www.repositorio.ufop.br/bitstream/123456789/11879/3/license_textd41d8cd98f00b204e9800998ecf8427eMD53license_rdflicense_rdfapplication/rdf+xml; charset=utf-80http://www.repositorio.ufop.br/bitstream/123456789/11879/4/license_rdfd41d8cd98f00b204e9800998ecf8427eMD54ORIGINALTESE_MixedIntegerProgramming.pdfTESE_MixedIntegerProgramming.pdfapplication/pdf4427261http://www.repositorio.ufop.br/bitstream/123456789/11879/1/TESE_MixedIntegerProgramming.pdf131b6552f8250a2958772830c15c1147MD51123456789/118792020-01-09 11:42:21.829oai:localhost:123456789/11879RGVjbGFyYcOnw6NvIGRlIGRpc3RyaWJ1acOnw6NvIG7Do28tZXhjbHVzaXZhCgpPIHJlZmVyaWRvIGF1dG9yOgoKYSlEZWNsYXJhIHF1ZSBvIGRvY3VtZW50byBlbnRyZWd1ZSDDqSBzZXUgdHJhYmFsaG8gb3JpZ2luYWwgZSBxdWUgZGV0w6ltIG8gZGlyZWl0byBkZSBjb25jZWRlciBvcyBkaXJlaXRvcyBjb250aWRvcyBuZXN0YSBsaWNlbsOnYS4gRGVjbGFyYSB0YW1iw6ltIHF1ZSBhIGVudHJlZ2EgZG8gZG9jdW1lbnRvIG7Do28gaW5mcmluZ2UsIHRhbnRvIHF1YW50byBsaGUgw6kgcG9zc8OtdmVsIHNhYmVyLCBvcyBkaXJlaXRvcyBkZSBxdWFscXVlciBwZXNzb2Egb3UgZW50aWRhZGUuCgpiKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIGNvbnTDqW0gbWF0ZXJpYWwgZG8gcXVhbCBuw6NvIGRldMOpbSBvcyBkaXJlaXRvcyBkZSBhdXRvciwgZGVjbGFyYSBxdWUgb2J0ZXZlIGF1dG9yaXphw6fDo28gZG8gZGV0ZW50b3IgZG9zIGRpcmVpdG9zIGRlIGF1dG9yIHBhcmEgY29uY2VkZXIgw6AgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZGUgT3VybyBQcmV0by9VRk9QIG9zIGRpcmVpdG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW7Dp2EgZSBxdWUgZXNzZSBtYXRlcmlhbCwgY3Vqb3MgZGlyZWl0b3Mgc8OjbyBkZSB0ZXJjZWlyb3MsIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3UgY29udGXDumRvcyBkbyBkb2N1bWVudG8gZW50cmVndWUuCgpjKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIMOpIGJhc2VhZG8gZW0gdHJhYmFsaG8gZmluYW5jaWFkbyBvdSBhcG9pYWRvIHBvciBvdXRyYSBpbnN0aXR1acOnw6NvIHF1ZSBuw6NvIGEgVUZPUCwgZGVjbGFyYSBxdWUgY3VtcHJpdSBxdWFpc3F1ZXIgb2JyaWdhw6fDtWVzIGV4aWdpZGFzIHBlbG8gY29udHJhdG8gb3UgYWNvcmRvLgoKRepositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332020-01-09T16:42:21Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false
dc.title.pt_BR.fl_str_mv Mixed-integer linear programming based approaches for the resource constrained project scheduling problem.
title Mixed-integer linear programming based approaches for the resource constrained project scheduling problem.
spellingShingle Mixed-integer linear programming based approaches for the resource constrained project scheduling problem.
Araujo, Janniele Aparecida Soares
Financiamento de projetos
Orçamento-programa
Programação linear
title_short Mixed-integer linear programming based approaches for the resource constrained project scheduling problem.
title_full Mixed-integer linear programming based approaches for the resource constrained project scheduling problem.
title_fullStr Mixed-integer linear programming based approaches for the resource constrained project scheduling problem.
title_full_unstemmed Mixed-integer linear programming based approaches for the resource constrained project scheduling problem.
title_sort Mixed-integer linear programming based approaches for the resource constrained project scheduling problem.
author Araujo, Janniele Aparecida Soares
author_facet Araujo, Janniele Aparecida Soares
author_role author
dc.contributor.referee.pt_BR.fl_str_mv Santos, Haroldo Gambini
Barboza, Eduardo Uchoa
Souza, Marcone Jamilson Freitas
Jena, Sanjay Dominik
Toffolo, Túlio Ângelo Machado
dc.contributor.author.fl_str_mv Araujo, Janniele Aparecida Soares
dc.contributor.advisor1.fl_str_mv Santos, Haroldo Gambini
contributor_str_mv Santos, Haroldo Gambini
dc.subject.por.fl_str_mv Financiamento de projetos
Orçamento-programa
Programação linear
topic Financiamento de projetos
Orçamento-programa
Programação linear
description Programa de Pós-Graduação em Ciência da Computação. Departamento de Ciência da Computação, Instituto de Ciências Exatas e Biológicas, Universidade Federal de Ouro Preto.
publishDate 2019
dc.date.issued.fl_str_mv 2019
dc.date.accessioned.fl_str_mv 2020-01-09T16:42:21Z
dc.date.available.fl_str_mv 2020-01-09T16:42:21Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/doctoralThesis
format doctoralThesis
status_str publishedVersion
dc.identifier.citation.fl_str_mv ARAUJO, Janniele Aparecida Soares. Mixed-integer linear programming based approaches for the resource constrained project scheduling problem. 2019. 96 f. Tese (Doutorado em Ciência da Computação) - Instituto de Ciências Exatas e Biológicas, Universidade Federal de Ouro Preto, Ouro Preto, 2019.
dc.identifier.uri.fl_str_mv http://www.repositorio.ufop.br/handle/123456789/11879
identifier_str_mv ARAUJO, Janniele Aparecida Soares. Mixed-integer linear programming based approaches for the resource constrained project scheduling problem. 2019. 96 f. Tese (Doutorado em Ciência da Computação) - Instituto de Ciências Exatas e Biológicas, Universidade Federal de Ouro Preto, Ouro Preto, 2019.
url http://www.repositorio.ufop.br/handle/123456789/11879
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFOP
instname:Universidade Federal de Ouro Preto (UFOP)
instacron:UFOP
instname_str Universidade Federal de Ouro Preto (UFOP)
instacron_str UFOP
institution UFOP
reponame_str Repositório Institucional da UFOP
collection Repositório Institucional da UFOP
bitstream.url.fl_str_mv http://www.repositorio.ufop.br/bitstream/123456789/11879/5/license.txt
http://www.repositorio.ufop.br/bitstream/123456789/11879/2/license_url
http://www.repositorio.ufop.br/bitstream/123456789/11879/3/license_text
http://www.repositorio.ufop.br/bitstream/123456789/11879/4/license_rdf
http://www.repositorio.ufop.br/bitstream/123456789/11879/1/TESE_MixedIntegerProgramming.pdf
bitstream.checksum.fl_str_mv 62604f8d955274beb56c80ce1ee5dcae
4afdbb8c545fd630ea7db775da747b2f
d41d8cd98f00b204e9800998ecf8427e
d41d8cd98f00b204e9800998ecf8427e
131b6552f8250a2958772830c15c1147
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)
repository.mail.fl_str_mv repositorio@ufop.edu.br
_version_ 1801685706241736704

Registros relacionados