Pages that link to "Item:Q2757572"

The following pages link to Approximation algorithms for the discrete time-cost tradeoff problem (Q2757572):

Displaying 30 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)
• An adaptive crashing policy for stochastic time-cost tradeoff problems (Q342024) (← links)
• Scheduling malleable tasks with precedence constraints (Q414874) (← links)
• Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495) (← 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)
• Machine scheduling with resource dependent processing times (Q877194) (← 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)
• Scheduling jobs with time-resource tradeoff via nonlinear programming (Q1040086) (← links)
• Simulated annealing and tabu search for multi-mode project payment scheduling (Q1042041) (← links)
• An approximation algorithm for the license and shift class design problem (Q1328603) (← 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)
• New computational results for the discrete time/cost trade-off problem with time-switch constraints (Q1772840) (← 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)
• A linear time-cost tradeoff problem with multiple milestones under a comb graph (Q2424814) (← links)
• A discrete EOQ problem is solvable in \(O(\log n)\) time (Q2482773) (← links)
• APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS (Q3021973) (← links)
• The Discrete Heal Algorithm With Intermediate Goods (Q3342166) (← links)
• Optimization of Multi-Threshold Circuits (Q3439526) (← links)
• Discrete Time-Cost Tradeoff with a Novel Hybrid Meta-Heuristic (Q3556554) (← links)
• (Q4220471) (← links)
• (Q5077804) (← 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)
• Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations (Q6534414) (← links)