Pages that link to "Item:Q707495"
From MaRDI portal
The following pages link to Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495):
Displaying 6 items.
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) (← links)
- An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs (Q1762128) (← links)
- A reduction tree approach for the discrete time/cost trade-off problem (Q2147020) (← links)
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← 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)
