An exact composite lower bound strategy for the resource-constrained project scheduling problem
This paper reports on results for the well-known resource-constrained project scheduling problem. A branch-and-bound procedure is developed that takes into account all best performing components from literature, varying branching schemes and search strategies, using the best performing dominance rul...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | preprint |
| Language: | eng |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.2/7911 |
| Country: | Portugal |
| Oai: | oai:repositorioaberto.uab.pt:10400.2/7911 |