Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds

Related Items (12)

Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining ⋮ Knowledge integration using problem spaces: A study in resource-constrained project scheduling ⋮ A lexicographic approach to the robust resource-constrained project scheduling problem ⋮ A practical and robust execution time-frame procedure for the multi-mode resource-constrained project scheduling problem with minimal and maximal time lags ⋮ Generic negotiation mechanisms with side payments -- design, analysis and application for decentralized resource-constrained multi-project scheduling problems ⋮ Multi-mode project payment scheduling problems with bonus-penalty structure ⋮ Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models ⋮ On project scheduling with irregular starting time costs ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Client‐contractor bargaining on net present value in project scheduling with limited resources ⋮ Project selection, scheduling and resource allocation with time dependent returns ⋮ Simulated annealing and tabu search for multi-mode project payment scheduling

Uses Software

PSPLIB

This page was built for publication: Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds