The following pages link to (Q4695780):
Displayed 12 items.
- Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
- The discrete time/cost trade-off problem: Extensions and heuristic procedures (Q835571) (← links)
- Robust scheduling and robustness measures for the discrete time/cost trade-off problem (Q992657) (← links)
- Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version (Q1040964) (← links)
- Simulated annealing and tabu search for multi-mode project payment scheduling (Q1042041) (← links)
- Optimal procedures for the discrete time/cost trade-off problem in project networks (Q1266562) (← links)
- Project network models with discounted cash flows a guided tour through recent developments (Q1278075) (← links)
- The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models (Q1634073) (← links)
- Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap (Q1652132) (← links)
- An agency perspective for multi-mode project scheduling with time/cost trade-offs (Q1722976) (← links)
- An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs (Q1762128) (← links)
- Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models (Q1767683) (← links)