Pages that link to "Item:Q2769012"

The following pages link to A Network Flow Computation for Project Cost Curves (Q2769012):

Displaying 50 items.

• Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs (Q299837) (← links)
• A float-path theory and its application to the time-cost tradeoff problem (Q305477) (← links)
• A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs (Q319449) (← links)
• Resource allocation in multi-class dynamic PERT networks with finite capacity (Q320114) (← links)
• An adaptive crashing policy for stochastic time-cost tradeoff problems (Q342024) (← links)
• Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem (Q708169) (← links)
• Robust resource allocations in temporal networks (Q715076) (← links)
• A parametric algorithm for convex cost network flow and related problems (Q789313) (← links)
• A network flow procedure for project crashing with penalty nodes (Q790038) (← links)
• The discrete time/cost trade-off problem: Extensions and heuristic procedures (Q835571) (← 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)
• The risk element transmission theory research of multi-objective risk-time-cost trade-off (Q971715) (← links)
• The discrete time-cost tradeoff problem revisited (Q1129886) (← links)
• Project management with time, cost, and quality considerations (Q1266596) (← links)
• The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure (Q1296080) (← links)
• Scheduling project activities in a distributed environment (Q1342009) (← links)
• A network flow algorithm for just-in-time project scheduling (Q1342048) (← links)
• Activity nets: A guided tour through some recent developments (Q1388902) (← links)
• Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks (Q1652374) (← 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)
• Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation (Q1805493) (← links)
• Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
• Hierarchical approach to project planning: The case of a petroleum pipeline construction (Q1816772) (← links)
• The construction of stable project baseline schedules (Q1877894) (← links)
• Multi-resource allocation in stochastic project scheduling (Q1931636) (← links)
• Managing risk-adjusted resource allocation for project time-cost tradeoffs (Q2095230) (← links)
• A reduction tree approach for the discrete time/cost trade-off problem (Q2147020) (← links)
• Optimal crashing of an activity network with disruptions (Q2149579) (← links)
• Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
• Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods) (Q2277354) (← links)
• Resource allocation via dynamic programming in activity networks (Q2366080) (← links)
• PERT and crashing revisited: Mathematical generalizations (Q2366086) (← links)
• A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search (Q2383848) (← links)
• A linear time-cost tradeoff problem with multiple milestones under a comb graph (Q2424814) (← 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 new approach based on the surrogating method in the project time compression problems (Q2507391) (← 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)
• A Decomposition Algorithm for Nested Resource Allocation Problems (Q2810553) (← links)
• The Bi-Criterial Approach to Project Cost and Schedule Buffers Sizing (Q3112560) (← links)
• (Q3191594) (← links)
• Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs (Q3455883) (← links)
• Die Berücksichtigung von Festterminrestriktionen bei der Projektplanung und -steuerung (Q4149200) (← links)
• A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph (Q5024918) (← links)
• (Q5077804) (← links)