The following pages link to (Q3426431):
Displaying 8 items.
- A rough-cut capacity planning model with overlapping (Q280165) (← links)
- Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres (Q439612) (← links)
- Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound (Q766253) (← links)
- A survey of variants and extensions of the resource-constrained project scheduling problem (Q992569) (← links)
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm (Q1935550) (← links)
- Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations (Q6534414) (← links)
- Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm (Q6588475) (← links)
