Pages that link to "Item:Q1129886"

The following pages link to The discrete time-cost tradeoff problem revisited (Q1129886):

Displaying 50 items.

• A float-path theory and its application to the time-cost tradeoff problem (Q305477) (← links)
• An adaptive crashing policy for stochastic time-cost tradeoff problems (Q342024) (← links)
• Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
• Activity consolidation to improve responsiveness (Q706959) (← links)
• Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495) (← links)
• Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem (Q708169) (← links)
• Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective (Q744648) (← links)
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563) (← links)
• The discrete time/cost trade-off problem: Extensions and heuristic procedures (Q835571) (← links)
• A note on time/cost tradeoff curve generation for project scheduling with multi-mode resource availability costs (Q840615) (← links)
• On the discrete time, cost and quality trade-off problem (Q856123) (← links)
• A heuristic procedure for solving the dynamic probabilistic project expediting problem (Q948658) (← links)
• A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations (Q991368) (← 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)
• Optimal procedures for the discrete time/cost trade-off problem in project networks (Q1266562) (← links)
• Hardness of approximation of the discrete time-cost tradeoff problem (Q1604050) (← links)
• A hybrid simulation-optimization approach for the robust discrete time/cost trade-off problem (Q1636886) (← links)
• Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap (Q1652132) (← links)
• Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks (Q1652374) (← links)
• Simplifying the nonlinear continuous time-cost tradeoff problem (Q1697748) (← links)
• Finding an optimal Nash equilibrium to the multi-agent project scheduling problem (Q1707826) (← links)
• An agency perspective for multi-mode project scheduling with time/cost trade-offs (Q1722976) (← links)
• Robust proactive project scheduling model for the stochastic discrete time/cost trade-off problem (Q1723411) (← links)
• An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs (Q1762128) (← 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)
• A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition (Q1788588) (← 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)
• The effect of risk aversion on the optimal project resource rate (Q2023999) (← links)
• Integrating risk into estimations of project activities' time and cost: a stratified approach (Q2030702) (← 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)
• Multimode time-cost-robustness trade-off project scheduling problem under uncertainty (Q2156293) (← links)
• Multimode resource-constrained project scheduling in flexible projects (Q2301187) (← links)
• A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems (Q2327625) (← links)
• A trade-off between time and cost in scheduling repetitive construction projects (Q2351296) (← links)
• A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search (Q2383848) (← links)
• Deadline division-based heuristic for cost optimization in workflow scheduling (Q2390377) (← links)
• A linear time-cost tradeoff problem with multiple milestones under a comb graph (Q2424814) (← links)
• A stochastic multimode model for time-cost tradeoffs under management flexibility (Q2460073) (← links)
• An application of randomized minimum cut to the project time/cost tradeoff problem (Q2489471) (← links)
• Discrete-time cost analysis for a telecommunication billing application with rejuvenation (Q2494799) (← links)
• A new approach based on the surrogating method in the project time compression problems (Q2507391) (← links)
• Approximation algorithms for the discrete time-cost tradeoff problem (Q2757572) (← links)
• Pdm time cost trade-off:activities are splittable or non-splittable (Q2785398) (← links)
• APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS (Q3021973) (← links)