Pages that link to "Item:Q1590042"
From MaRDI portal
The following pages link to A new LP-based lower bound for the cumulative scheduling problem (Q1590042):
Displayed 9 items.
- An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling (Q342571) (← links)
- A preemptive bound for the resource constrained project scheduling problem (Q398922) (← links)
- A survey of dual-feasible and superadditive functions (Q610986) (← links)
- Computing redundant resources for the resource constrained project scheduling problem (Q853022) (← links)
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985) (← links)
- On linear lower bounds for the resource constrained project scheduling problem. (Q1399576) (← links)
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (Q1711441) (← links)
- New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem (Q3114308) (← links)
- Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5917883) (← links)