A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective
Xue Li, Zhengwen He, Nengmin Wang
| Year of publication: |
2024
|
|---|---|
| Authors: | Li, Xue ; He, Zhengwen ; Wang, Nengmin |
| Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 166.2024, Art.-No. 106623, p. 1-19
|
| Subject: | Robustness | Project scheduling | Branch-and-bound algorithm | Optimization model | Resource constraint | Scheduling-Verfahren | Scheduling problem | Projektmanagement | Project management | Theorie | Theory | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2024.106623 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10014564986