Skip to content
Opt Dir

Glossary ยท approach

RCPSP

Sequencing hundreds of project tasks, sizing durations, and assigning crews under precedence and resource constraints.

Resource-Constrained Project Scheduling ProblemProject Scheduling
RCPSP (Resource-Constrained Project Scheduling Problem) is the problem of finding the shortest total project duration (makespan) given (i) precedence relations between tasks and (ii) shared resources (crews, machines, cranes) that limit how many tasks can run at the same time. It started in the 1960s with PERT/CPM and matured when resource constraints were added. It is the standard approach in construction, shipbuilding, software project management, product development, and maintenance planning. Classical MIP/CP formulations are exact up to 30โ€“100 tasks; larger problems use metaheuristics (genetic algorithms, simulated annealing).
ร–rnek

On a 200-task residential project with 5 formwork crews, 3 rebar crews, 2 concrete crews, and 1 crane: find the schedule that minimizes project duration while honoring precedence (columns โ†’ slab formwork โ†’ slab pour) and the holiday calendar.

Where this term appears

Esc Close