scientific article; zbMATH DE number 3661085
From MaRDI portal
Publication:3859552
Cited in
(16)- Simulated annealing and tabu search for multi-mode project payment scheduling
- The discrete time-cost tradeoff problem revisited
- Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement
- Robust proactive project scheduling model for the stochastic discrete time/cost trade-off problem
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
- New computational results for the discrete time/cost trade-off problem with time-switch constraints
- Resource-constrained project scheduling: Notation, classification, models, and methods
- A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling
- A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search
- A float-path theory and its application to the time-cost tradeoff problem
- Project scheduling with irregular costs: complexity, approximability, and algorithms
- The discrete time/cost trade-off problem: Extensions and heuristic procedures
- On the discrete time, cost and quality trade-off problem
- Using a risk-based approach to project scheduling: a case illustration from semiconductor manufacturing
- A heuristic procedure for solving the dynamic probabilistic project expediting problem
- A new path-based cutting plane approach for the discrete time-cost tradeoff problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3859552)
