Pages that link to "Item:Q5948202"
From MaRDI portal
The following pages link to Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds (Q5948202):
Displayed 11 items.
- Knowledge integration using problem spaces: A study in resource-constrained project scheduling (Q880537) (← links)
- A survey of variants and extensions of the resource-constrained project scheduling problem (Q992569) (← links)
- Simulated annealing and tabu search for multi-mode project payment scheduling (Q1042041) (← links)
- A practical and robust execution time-frame procedure for the multi-mode resource-constrained project scheduling problem with minimal and maximal time lags (Q1736833) (← links)
- Generic negotiation mechanisms with side payments -- design, analysis and application for decentralized resource-constrained multi-project scheduling problems (Q1753651) (← links)
- Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models (Q1767683) (← links)
- Multi-mode project payment scheduling problems with bonus-penalty structure (Q2482794) (← links)
- Project selection, scheduling and resource allocation with time dependent returns (Q2519075) (← links)
- A lexicographic approach to the robust resource-constrained project scheduling problem (Q2968494) (← links)
- Client‐contractor bargaining on net present value in project scheduling with limited resources (Q3621917) (← links)
- On project scheduling with irregular starting time costs (Q5945382) (← links)