Pages that link to "Item:Q4656679"
From MaRDI portal
The following pages link to Discrete time/cost trade-offs in project scheduling with time-switch constraints (Q4656679):
Displayed 10 items.
- Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
- When it is worthwhile to work with the stochastic RCPSP? (Q835549) (← links)
- The discrete time/cost trade-off problem: Extensions and heuristic procedures (Q835571) (← links)
- A survey of variants and extensions of the resource-constrained project scheduling problem (Q992569) (← links)
- Structured construction and simulation of nondeterministic stochastic activity networks (Q1027622) (← links)
- An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs (Q1762128) (← links)
- New computational results for the discrete time/cost trade-off problem with time-switch constraints (Q1772840) (← links)
- A reduction tree approach for the discrete time/cost trade-off problem (Q2147020) (← links)
- Integration of routing into a resource-constrained project scheduling problem (Q2175371) (← links)
- A solution approach to find the critical path in a time-constrained activity network (Q2270440) (← links)