The following pages link to (Q3859552):
Displaying 16 items.
- A float-path theory and its application to the time-cost tradeoff problem (Q305477) (← links)
- Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495) (← links)
- The discrete time/cost trade-off problem: Extensions and heuristic procedures (Q835571) (← links)
- On the discrete time, cost and quality trade-off problem (Q856123) (← links)
- Using a risk-based approach to project scheduling: a case illustration from semiconductor manufacturing (Q928039) (← links)
- A heuristic procedure for solving the dynamic probabilistic project expediting problem (Q948658) (← links)
- A new path-based cutting plane approach for the discrete time-cost tradeoff problem (Q993703) (← links)
- Simulated annealing and tabu search for multi-mode project payment scheduling (Q1042041) (← links)
- The discrete time-cost tradeoff problem revisited (Q1129886) (← links)
- Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement (Q1718808) (← links)
- Robust proactive project scheduling model for the stochastic discrete time/cost trade-off problem (Q1723411) (← links)
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem (Q1772839) (← links)
- New computational results for the discrete time/cost trade-off problem with time-switch constraints (Q1772840) (← links)
- Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
- A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling (Q1885984) (← links)
- A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search (Q2383848) (← links)
