Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds
From MaRDI portal
Publication:5948202
DOI10.1023/A:1010962300979zbMath0990.90510MaRDI QIDQ5948202
Publication date: 31 October 2001
Published in: Annals of Operations Research (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
On project scheduling with irregular starting time costs, Knowledge integration using problem spaces: A study in resource-constrained project scheduling, A survey of variants and extensions of the resource-constrained project scheduling problem, Simulated annealing and tabu search for multi-mode project payment scheduling, Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models, Multi-mode project payment scheduling problems with bonus-penalty structure, Project selection, scheduling and resource allocation with time dependent returns, Client‐contractor bargaining on net present value in project scheduling with limited resources
Uses Software