Name
Title | ||
|---|---|---|
Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes |
Abstract | ||
|---|---|---|
•A new effective preprocessing algorithm for compact formulations was proposed.•The proposed cutting plane algorithm produced improved dual bounds for all variants.•The most effective cutting planes were the lifted precedence cuts.•Strengthening techniques improved well-known cuts.•774 open instances from literature were solved for the first time. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.cor.2019.104782 | Computers & Operations Research |
Keywords | Field | DocType |
Resource constrained project scheduling,Cutting planes,Mixed-integer linear programming,Preprocessing | Graph,Schedule (project management),Mathematical optimization,Preemption,Combinatorial optimization problem,Cutting plane algorithm,Preprocessor,Linear programming,Solver,Mathematics | Journal |
Volume | ISSN | Citations |
113 | 0305-0548 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Janniele A. S. Araujo | 1 | 0 | 0.34 |
| Haroldo G. Santos | 2 | 108 | 9.75 |
| Bernard Gendron | 3 | 688 | 49.92 |
| Sanjay Dominik Jena | 4 | 40 | 4.03 |
| Samuel S. Brito | 5 | 12 | 1.33 |
| Danilo S. Souza | 6 | 0 | 0.34 |