An integer programming approach to the multimode resource-constrained multiproject scheduling problem.
Autor(a) principal: | |
---|---|
Data de Publicação: | 2016 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UFOP |
Texto Completo: | http://www.repositorio.ufop.br/handle/123456789/7169 http://download.springer.com/static/pdf/549/art%253A10.1007%252Fs10951-015-0422-4.pdf?originUrl=http%3A%2F%2Flink.springer.com%2Farticle%2F10.1007%2Fs10951-015-0422-4&token2=exp=1484912014~acl=%2Fstatic%2Fpdf%2F549%2Fart%25253A10.1007%25252Fs10951-015-0422-4.pdf%3ForiginUrl%3Dhttp%253A%252F%252Flink.springer.com%252Farticle%252F10.1007%252Fs10951-015-0422-4*~hmac=6af17dc04a689c25c355b7d8e2f8bb745ff2050e1ae15aae5f2704fa34286a23 |
Resumo: | The project scheduling problem (PSP) is the subject of several studies in computer science, mathematics, and operations research because of the hardness of solving it and its practical importance. This work tackles an extended version of the problem known as the multimode resourceconstrained multiproject scheduling problem. A solution to this problem consists of a schedule of jobs from various projects, so that the job allocations do not exceed the stipulated limits of renewable and nonrenewable resources. To accomplish this, a set of execution modes for the jobs must be chosen, as the jobs’ duration and amount of needed resources vary depending on the mode selected. Finally, the schedule must also consider precedence constraints between jobs. This work proposes heuristic methods based on integer programming to solve the PSP considered in the Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA) 2013 Challenge. The developed solver was ranked third in the competition, being able to find feasible and competitive solutions for all instances and improving best known solutions for some problems. |
id |
UFOP_ebe7b8c5b1001e19322f8e1c88d336f6 |
---|---|
oai_identifier_str |
oai:localhost:123456789/7169 |
network_acronym_str |
UFOP |
network_name_str |
Repositório Institucional da UFOP |
repository_id_str |
3233 |
spelling |
Toffolo, Túlio Ângelo MachadoSantos, Haroldo GambiniCarvalho, Marco Antonio Moreira deSoares, Janniele Aparecida2017-02-01T12:49:23Z2017-02-01T12:49:23Z2016TOFFOLO, T. A. M. et al. An integer programming approach to the multimode resource-constrained multiproject scheduling problem. Journal of Scheduling, v. 19, n. 5, p. 295-307, 2016. Disponível em: <http://download.springer.com/static/pdf/549/art%253A10.1007%252Fs10951-015-0422-4.pdf?originUrl=http%3A%2F%2Flink.springer.com%2Farticle%2F10.1007%2Fs10951-015-0422-4&token2=exp=1484912014~acl=%2Fstatic%2Fpdf%2F549%2Fart%25253A10.1007%25252Fs10951-015-0422-4.pdf%3ForiginUrl%3Dhttp%253A%252F%252Flink.springer.com%252Farticle%252F10.1007%252Fs10951-015-0422-4*~hmac=6af17dc04a689c25c355b7d8e2f8bb745ff2050e1ae15aae5f2704fa34286a23>. Acesso em: 20 jan. 2017.10991425http://www.repositorio.ufop.br/handle/123456789/7169http://download.springer.com/static/pdf/549/art%253A10.1007%252Fs10951-015-0422-4.pdf?originUrl=http%3A%2F%2Flink.springer.com%2Farticle%2F10.1007%2Fs10951-015-0422-4&token2=exp=1484912014~acl=%2Fstatic%2Fpdf%2F549%2Fart%25253A10.1007%25252Fs10951-015-0422-4.pdf%3ForiginUrl%3Dhttp%253A%252F%252Flink.springer.com%252Farticle%252F10.1007%252Fs10951-015-0422-4*~hmac=6af17dc04a689c25c355b7d8e2f8bb745ff2050e1ae15aae5f2704fa34286a23The project scheduling problem (PSP) is the subject of several studies in computer science, mathematics, and operations research because of the hardness of solving it and its practical importance. This work tackles an extended version of the problem known as the multimode resourceconstrained multiproject scheduling problem. A solution to this problem consists of a schedule of jobs from various projects, so that the job allocations do not exceed the stipulated limits of renewable and nonrenewable resources. To accomplish this, a set of execution modes for the jobs must be chosen, as the jobs’ duration and amount of needed resources vary depending on the mode selected. Finally, the schedule must also consider precedence constraints between jobs. This work proposes heuristic methods based on integer programming to solve the PSP considered in the Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA) 2013 Challenge. The developed solver was ranked third in the competition, being able to find feasible and competitive solutions for all instances and improving best known solutions for some problems.MatheuristicsMultidisciplinary International Scheduling Conference: Theory and Applications - MISTA - 2013 ChallengeAn integer programming approach to the multimode resource-constrained multiproject scheduling problem.info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccessengreponame: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/7169/2/license.txt62604f8d955274beb56c80ce1ee5dcaeMD52ORIGINALARTIGO_IntegerProgrammingApproach.pdfARTIGO_IntegerProgrammingApproach.pdfapplication/pdf604230http://www.repositorio.ufop.br/bitstream/123456789/7169/1/ARTIGO_IntegerProgrammingApproach.pdf5239c21796a48595f5b5a8432ac6ef0aMD51123456789/71692017-02-01 07:49:23.921oai:localhost:123456789/7169RGVjbGFyYcOnw6NvIGRlIGRpc3RyaWJ1acOnw6NvIG7Do28tZXhjbHVzaXZhCgpPIHJlZmVyaWRvIGF1dG9yOgoKYSlEZWNsYXJhIHF1ZSBvIGRvY3VtZW50byBlbnRyZWd1ZSDDqSBzZXUgdHJhYmFsaG8gb3JpZ2luYWwgZSBxdWUgZGV0w6ltIG8gZGlyZWl0byBkZSBjb25jZWRlciBvcyBkaXJlaXRvcyBjb250aWRvcyBuZXN0YSBsaWNlbsOnYS4gRGVjbGFyYSB0YW1iw6ltIHF1ZSBhIGVudHJlZ2EgZG8gZG9jdW1lbnRvIG7Do28gaW5mcmluZ2UsIHRhbnRvIHF1YW50byBsaGUgw6kgcG9zc8OtdmVsIHNhYmVyLCBvcyBkaXJlaXRvcyBkZSBxdWFscXVlciBwZXNzb2Egb3UgZW50aWRhZGUuCgpiKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIGNvbnTDqW0gbWF0ZXJpYWwgZG8gcXVhbCBuw6NvIGRldMOpbSBvcyBkaXJlaXRvcyBkZSBhdXRvciwgZGVjbGFyYSBxdWUgb2J0ZXZlIGF1dG9yaXphw6fDo28gZG8gZGV0ZW50b3IgZG9zIGRpcmVpdG9zIGRlIGF1dG9yIHBhcmEgY29uY2VkZXIgw6AgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZGUgT3VybyBQcmV0by9VRk9QIG9zIGRpcmVpdG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW7Dp2EgZSBxdWUgZXNzZSBtYXRlcmlhbCwgY3Vqb3MgZGlyZWl0b3Mgc8OjbyBkZSB0ZXJjZWlyb3MsIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3UgY29udGXDumRvcyBkbyBkb2N1bWVudG8gZW50cmVndWUuCgpjKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIMOpIGJhc2VhZG8gZW0gdHJhYmFsaG8gZmluYW5jaWFkbyBvdSBhcG9pYWRvIHBvciBvdXRyYSBpbnN0aXR1acOnw6NvIHF1ZSBuw6NvIGEgVUZPUCwgZGVjbGFyYSBxdWUgY3VtcHJpdSBxdWFpc3F1ZXIgb2JyaWdhw6fDtWVzIGV4aWdpZGFzIHBlbG8gY29udHJhdG8gb3UgYWNvcmRvLgoKRepositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332017-02-01T12:49:23Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false |
dc.title.pt_BR.fl_str_mv |
An integer programming approach to the multimode resource-constrained multiproject scheduling problem. |
title |
An integer programming approach to the multimode resource-constrained multiproject scheduling problem. |
spellingShingle |
An integer programming approach to the multimode resource-constrained multiproject scheduling problem. Toffolo, Túlio Ângelo Machado Matheuristics Multidisciplinary International Scheduling Conference: Theory and Applications - MISTA - 2013 Challenge |
title_short |
An integer programming approach to the multimode resource-constrained multiproject scheduling problem. |
title_full |
An integer programming approach to the multimode resource-constrained multiproject scheduling problem. |
title_fullStr |
An integer programming approach to the multimode resource-constrained multiproject scheduling problem. |
title_full_unstemmed |
An integer programming approach to the multimode resource-constrained multiproject scheduling problem. |
title_sort |
An integer programming approach to the multimode resource-constrained multiproject scheduling problem. |
author |
Toffolo, Túlio Ângelo Machado |
author_facet |
Toffolo, Túlio Ângelo Machado Santos, Haroldo Gambini Carvalho, Marco Antonio Moreira de Soares, Janniele Aparecida |
author_role |
author |
author2 |
Santos, Haroldo Gambini Carvalho, Marco Antonio Moreira de Soares, Janniele Aparecida |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Toffolo, Túlio Ângelo Machado Santos, Haroldo Gambini Carvalho, Marco Antonio Moreira de Soares, Janniele Aparecida |
dc.subject.por.fl_str_mv |
Matheuristics Multidisciplinary International Scheduling Conference: Theory and Applications - MISTA - 2013 Challenge |
topic |
Matheuristics Multidisciplinary International Scheduling Conference: Theory and Applications - MISTA - 2013 Challenge |
description |
The project scheduling problem (PSP) is the subject of several studies in computer science, mathematics, and operations research because of the hardness of solving it and its practical importance. This work tackles an extended version of the problem known as the multimode resourceconstrained multiproject scheduling problem. A solution to this problem consists of a schedule of jobs from various projects, so that the job allocations do not exceed the stipulated limits of renewable and nonrenewable resources. To accomplish this, a set of execution modes for the jobs must be chosen, as the jobs’ duration and amount of needed resources vary depending on the mode selected. Finally, the schedule must also consider precedence constraints between jobs. This work proposes heuristic methods based on integer programming to solve the PSP considered in the Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA) 2013 Challenge. The developed solver was ranked third in the competition, being able to find feasible and competitive solutions for all instances and improving best known solutions for some problems. |
publishDate |
2016 |
dc.date.issued.fl_str_mv |
2016 |
dc.date.accessioned.fl_str_mv |
2017-02-01T12:49:23Z |
dc.date.available.fl_str_mv |
2017-02-01T12:49:23Z |
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 |
TOFFOLO, T. A. M. et al. An integer programming approach to the multimode resource-constrained multiproject scheduling problem. Journal of Scheduling, v. 19, n. 5, p. 295-307, 2016. Disponível em: <http://download.springer.com/static/pdf/549/art%253A10.1007%252Fs10951-015-0422-4.pdf?originUrl=http%3A%2F%2Flink.springer.com%2Farticle%2F10.1007%2Fs10951-015-0422-4&token2=exp=1484912014~acl=%2Fstatic%2Fpdf%2F549%2Fart%25253A10.1007%25252Fs10951-015-0422-4.pdf%3ForiginUrl%3Dhttp%253A%252F%252Flink.springer.com%252Farticle%252F10.1007%252Fs10951-015-0422-4*~hmac=6af17dc04a689c25c355b7d8e2f8bb745ff2050e1ae15aae5f2704fa34286a23>. Acesso em: 20 jan. 2017. |
dc.identifier.uri.fl_str_mv |
http://www.repositorio.ufop.br/handle/123456789/7169 |
dc.identifier.issn.none.fl_str_mv |
10991425 |
dc.identifier.uri2.pt_BR.fl_str_mv |
http://download.springer.com/static/pdf/549/art%253A10.1007%252Fs10951-015-0422-4.pdf?originUrl=http%3A%2F%2Flink.springer.com%2Farticle%2F10.1007%2Fs10951-015-0422-4&token2=exp=1484912014~acl=%2Fstatic%2Fpdf%2F549%2Fart%25253A10.1007%25252Fs10951-015-0422-4.pdf%3ForiginUrl%3Dhttp%253A%252F%252Flink.springer.com%252Farticle%252F10.1007%252Fs10951-015-0422-4*~hmac=6af17dc04a689c25c355b7d8e2f8bb745ff2050e1ae15aae5f2704fa34286a23 |
identifier_str_mv |
TOFFOLO, T. A. M. et al. An integer programming approach to the multimode resource-constrained multiproject scheduling problem. Journal of Scheduling, v. 19, n. 5, p. 295-307, 2016. Disponível em: <http://download.springer.com/static/pdf/549/art%253A10.1007%252Fs10951-015-0422-4.pdf?originUrl=http%3A%2F%2Flink.springer.com%2Farticle%2F10.1007%2Fs10951-015-0422-4&token2=exp=1484912014~acl=%2Fstatic%2Fpdf%2F549%2Fart%25253A10.1007%25252Fs10951-015-0422-4.pdf%3ForiginUrl%3Dhttp%253A%252F%252Flink.springer.com%252Farticle%252F10.1007%252Fs10951-015-0422-4*~hmac=6af17dc04a689c25c355b7d8e2f8bb745ff2050e1ae15aae5f2704fa34286a23>. Acesso em: 20 jan. 2017. 10991425 |
url |
http://www.repositorio.ufop.br/handle/123456789/7169 http://download.springer.com/static/pdf/549/art%253A10.1007%252Fs10951-015-0422-4.pdf?originUrl=http%3A%2F%2Flink.springer.com%2Farticle%2F10.1007%2Fs10951-015-0422-4&token2=exp=1484912014~acl=%2Fstatic%2Fpdf%2F549%2Fart%25253A10.1007%25252Fs10951-015-0422-4.pdf%3ForiginUrl%3Dhttp%253A%252F%252Flink.springer.com%252Farticle%252F10.1007%252Fs10951-015-0422-4*~hmac=6af17dc04a689c25c355b7d8e2f8bb745ff2050e1ae15aae5f2704fa34286a23 |
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/7169/2/license.txt http://www.repositorio.ufop.br/bitstream/123456789/7169/1/ARTIGO_IntegerProgrammingApproach.pdf |
bitstream.checksum.fl_str_mv |
62604f8d955274beb56c80ce1ee5dcae 5239c21796a48595f5b5a8432ac6ef0a |
bitstream.checksumAlgorithm.fl_str_mv |
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_ |
1801685751961747456 |