Strong bounds for resource constrained project scheduling : preprocessing and cutting planes
| Year of publication: |
2020
|
|---|---|
| Authors: | Araujo, Janniele A. S. ; Santos, Haroldo Gambini ; Gendron, Bernard ; Jena, Sanjay Dominik ; Brito, Samuel Souza ; Souza, Danilo S. |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 113.2020, p. 1-16
|
| Subject: | Cutting planes | Mixed-integer linear programming | Preprocessing | Resource constrained project scheduling | Projektmanagement | Project management | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Theorie | Theory |
-
A mixed-integer programming-based heuristic for project scheduling with work-content constraints
Zimmermann, Adrian, (2017)
-
Single mode resource constrained project scheduling with unreliable resources
Chakrabortty, Ripon K., (2020)
-
Wang, Jianjiang, (2023)
- More ...
-
Preprocessing and cutting planes with conflict graphs
Brito, Samuel Souza, (2021)
-
Cover by disjoint cliques cuts for the knapsack problem with conflicting items
Luiz, Thiago Alcântara, (2021)
-
Integrating matheuristics and metaheuristics for timetabling
Fonseca, George H. G., (2016)
- More ...