Pages that link to "Item:Q1772839"

The following pages link to Network decomposition-based benchmark results for the discrete time-cost tradeoff problem (Q1772839):

Displayed 11 items.

• Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) ‎ (← links)
• Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem (Q708169) ‎ (← links)
• A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations (Q991368) ‎ (← links)
• A survey of variants and extensions of the resource-constrained project scheduling problem (Q992569) ‎ (← 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)
• Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming (Q1764795) ‎ (← links)
• Deadline division-based heuristic for cost optimization in workflow scheduling (Q2390377) ‎ (← links)
• Project selection, scheduling and resource allocation with time dependent returns (Q2519075) ‎ (← links)