Optimum Time Compression in Project Scheduling
From MaRDI portal
Cited in
(16)- The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure
- Simplifying the nonlinear continuous time-cost tradeoff problem
- New computational results for the discrete time/cost trade-off problem with time-switch constraints
- Time-cost trade-off via optimal control theory in Markov PERT networks
- A multi-objective resource allocation problem in PERT networks
- A genetic algorithm approach for the time-cost trade-off in PERT networks
- A float-path theory and its application to the time-cost tradeoff problem
- A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
- Resource allocation in multi-class dynamic PERT networks with finite capacity
- An adaptive crashing policy for stochastic time-cost tradeoff problems
- A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
- The discrete time/cost trade-off problem: Extensions and heuristic procedures
- Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach
- A multi-objective resource allocation problem in dynamic PERT networks
- A heuristic procedure for solving the dynamic probabilistic project expediting problem
- The risk element transmission theory research of multi-objective risk-time-cost trade-off
This page was built for publication: Optimum Time Compression in Project Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5590540)
