On some implementations of solving the resource constrained project scheduling problems
DOI10.2298/YJOR171115025GzbMath1474.90144OpenAlexW2897843056WikidataQ129096196 ScholiaQ129096196MaRDI QIDQ3388406
D. V. Mishin, E. N. Goncharov, E. Kh. Gimadi
Publication date: 5 May 2021
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/yjor171115025g
project managementbranch and bound algorithmsrenewable resourcesresource constrained project scheduling problemcumulative resourcesPCPLIB
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (4)
Uses Software
Cites Work
- Scheduling subject to resource constraints: Classification and complexity
- NP-complete scheduling problems
- PSPLIB -- a project scheduling problem library
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Resource-constrained project scheduling: A survey of recent developments.
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Tight LP bounds for resource constrained project scheduling
- Genetic algorithm for the resource-constrained project scheduling problem
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On some implementations of solving the resource constrained project scheduling problems
