Pages that link to "Item:Q1711441"
From MaRDI portal
The following pages link to An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (Q1711441):
Displaying 3 items.
- An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations (Q439614) (← links)
- An evolutionary approach for resource constrained project scheduling with uncertain changes (Q2664456) (← links)
- A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty (Q6555181) (← links)
