Makespan minimization in projects with threshold activities
From MaRDI portal
Publication:3626432
Recommendations
- Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm
- Critical path in an activity network with time constraints
- Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
- Scheduling of project networks
- PERT scheduling with convex cost functions.
Cited in
(3)
This page was built for publication: Makespan minimization in projects with threshold activities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3626432)