Pages that link to "Item:Q1266562"

The following pages link to Optimal procedures for the discrete time/cost trade-off problem in project networks (Q1266562):

Displaying 43 items.

• Time-cost trade-off analysis of project networks in fuzzy environments (Q421542) (← links)
• Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem (Q708169) (← links)
• Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) (← 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)
• Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach (Q872140) (← links)
• A multi-objective resource allocation problem in dynamic PERT networks (Q945351) (← links)
• A heuristic procedure for solving the dynamic probabilistic project expediting problem (Q948658) (← links)
• Scheduling projects with heterogeneous resources to meet time and quality objectives (Q954926) (← links)
• Robust scheduling and robustness measures for the discrete time/cost trade-off problem (Q992657) (← links)
• A new path-based cutting plane approach for the discrete time-cost tradeoff problem (Q993703) (← 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)
• The discrete time-cost tradeoff problem revisited (Q1129886) (← links)
• Optimal procedures for the discrete time/cost trade-off problem in project networks (Q1266562) (← links)
• On the use of the complexity index as a measure of complexity in activity networks (Q1278225) (← links)
• The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure (Q1296080) (← links)
• Improving project cost estimation by taking into account managerial flexibility (Q1590029) (← links)
• A hybrid simulation-optimization approach for the robust discrete time/cost trade-off problem (Q1636886) (← links)
• Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks (Q1652374) (← links)
• Optimal workforce assignment to operations of a paced assembly line (Q1694335) (← links)
• A path-based gradient projection algorithm for the cost-based system optimum problem in networks with continuously distributed value of time (Q1714543) (← links)
• Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming (Q1764795) (← 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 reduction tree approach for the discrete time/cost trade-off problem (Q2147020) (← links)
• Multimode time-cost-robustness trade-off project scheduling problem under uncertainty (Q2156293) (← links)
• Multimode resource-constrained project scheduling in flexible projects (Q2301187) (← links)
• A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search (Q2383848) (← links)
• Time-cost trade-off via optimal control theory in Markov PERT networks (Q2480200) (← links)
• A multi-objective resource allocation problem in PERT networks (Q2488911) (← links)
• An application of randomized minimum cut to the project time/cost tradeoff problem (Q2489471) (← links)
• A genetic algorithm approach for the time-cost trade-off in PERT networks (Q2572768) (← links)
• Pdm time cost trade-off:activities are splittable or non-splittable (Q2785398) (← links)
• New computational results on the discrete time/cost trade-off problem in project networks (Q3157790) (← links)
• Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time (Q3313600) (← links)
• Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks (Q3541789) (← links)
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks (Q4367255) (← links)
• Integrated time–cost tradeoff and resources leveling problems with allowed activity splitting (Q6066283) (← links)
• Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations (Q6534414) (← links)
• An exact decomposition technique for the deadline-constrained discrete time/cost trade-off problem with discounted cash flows (Q6551096) (← links)
• On the summary measures for the resource-constrained project scheduling problem (Q6581387) (← links)