Please use this identifier to cite or link to this item:
http://www.repositorio.ufop.br/jspui/handle/123456789/12841
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Araujo, Janniele Aparecida Soares | - |
dc.contributor.author | Santos, Haroldo Gambini | - |
dc.contributor.author | Gendron, Bernard | - |
dc.contributor.author | Jena, Sanjay Dominik | - |
dc.contributor.author | Brito, Samuel Souza | - |
dc.contributor.author | Souza, Danilo Santos | - |
dc.date.accessioned | 2020-10-13T17:07:58Z | - |
dc.date.available | 2020-10-13T17:07:58Z | - |
dc.date.issued | 2020 | pt_BR |
dc.identifier.citation | ARAUJO, J. A. S. et al. Strong bounds for resource constrained project scheduling: preprocessing and cutting planes. Computers & Operations Research, v. 113, jan. 2020. Disponível em: <https://www.sciencedirect.com/science/article/pii/S0305054819302242>. Acesso em: 10 mar. 2020. | pt_BR |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://www.repositorio.ufop.br/handle/123456789/12841 | - |
dc.description.abstract | Resource Constrained Project Scheduling Problems (RCPSPs) without preemption are well-known N Phard combinatorial optimization problems. A feasible RCPSP solution consists of a time-ordered schedule of jobs with corresponding execution modes, respecting precedence and resources constraints. In this paper, 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 conflict 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-theart mixed-integer linear programming solver to find provably optimal solutions for 754 previously open instances of different variants of the RCPSPs, which was not possible using the original linear programming formulations. | pt_BR |
dc.language.iso | en_US | pt_BR |
dc.rights | restrito | pt_BR |
dc.subject | Mixed-integer linear programming | pt_BR |
dc.title | Strong bounds for resource constrained project scheduling : preprocessing and cutting planes. | pt_BR |
dc.type | Artigo publicado em periodico | pt_BR |
dc.identifier.uri2 | https://www.sciencedirect.com/science/article/abs/pii/S0305054819302242?via%3Dihub | pt_BR |
dc.identifier.doi | https://doi.org/10.1016/j.cor.2019.104782 | pt_BR |
Appears in Collections: | DECSI - Artigos publicados em periódicos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ARTIGO_StrongBoundsResource.pdf Restricted Access | 1,14 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.