Pages that link to "Item:Q4367255"

The following pages link to Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks (Q4367255):

Displaying 44 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 multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations (Q337079) (← links)
• An adaptive crashing policy for stochastic time-cost tradeoff problems (Q342024) (← links)
• Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495) (← links)
• Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective (Q744648) (← links)
• Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment (Q744657) (← links)
• Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) (← 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 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)
• Bin packing with controllable item sizes (Q1004389) (← 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)
• Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap (Q1652132) (← links)
• Simplifying the nonlinear continuous time-cost tradeoff problem (Q1697748) (← 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)
• 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)
• Optimal crashing of an activity network with disruptions (Q2149579) (← links)
• Multimode resource-constrained project scheduling in flexible projects (Q2301187) (← 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)
• Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs (Q3455883) (← links)
• Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations (Q3458826) (← links)
• Work Package Sizing and Project Performance (Q4971582) (← links)
• On the choice of baseline schedules for the discrete time/resource trade-off problem under stochastic environment (Q4978242) (← links)
• (Q5077804) (← links)
• Robust Capacity Planning for Project Management (Q5084614) (← links)
• Approximating the discrete time-cost tradeoff problem with bounded depth (Q5918419) (← links)
• Approximating the discrete time-cost tradeoff problem with bounded depth (Q5925637) (← links)
• The contractor time–cost–credit trade‐off problem: integer programming model, heuristic solution, and business insights (Q6090500) (← links)
• Single-machine scheduling of multiple projects with controllable processing times (Q6167669) (← links)