A new time-driven mixed-integer programming model for rough-cut capacity planning
From MaRDI portal
Cites work
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- A hybrid metaheuristic for resource-constrained project scheduling with flexible resource profiles
- A list-scheduling heuristic for the short-term planning of assessment centers
- A project scheduling problem with periodically aggregated resource-constraints
- A rough-cut capacity planning model with overlapping
- Aggregate and detailed production planning integrating procurement and distribution plans in a multi-site environment
- Benders decomposition for a period-aggregated resource leveling problem with variable job duration
- MIP models for resource-constrained project scheduling with flexible resource profiles
- On the strength of time-indexed formulations for the resource-constrained project scheduling problem
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- RCPS with variable intensity activities and feeding precedence constraints
- Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities
- Resource-constrained project scheduling with flexible resource profiles in continuous time
- Scenario-based approach for flexible resource loading under uncertainty
- Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm
- Scheduling and staffing multiple projects with a multi-skilled workforce
- Scheduling of resource-constrained projects
This page was built for publication: A new time-driven mixed-integer programming model for rough-cut capacity planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255499)
