Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows

DOI10.1016/0377-2217(95)00382-7zbMath0926.90042OpenAlexW2021889655MaRDI QIDQ1278462

Avraham Shtub, Larry J. Le Blanc, Ran Etgar

Publication date: 29 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00382-7

zbMATH Keywords

project schedulingsimulated annealingnet present value

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Which fuzzy ranking method is best for maximizing fuzzy net present value? ⋮ The project scheduling problem with irregular starting time costs ⋮ Metaheuristics for multi-mode capital-constrained project payment scheduling ⋮ Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ A GA optimization model for workgroup-based repetitive scheduling (WoRSM) ⋮ Client‐contractor bargaining on net present value in project scheduling with limited resources ⋮ Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective ⋮ Progress payments in project scheduling problems. ⋮ Optimization of a highway project planning using a modified genetic algorithm ⋮ An integer linear programming model and a modified branch and bound algorithm for the project material requirements planning problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The scheduling of activities to maximize the net present value of projects
• Simulated annealing applied to the process allocation problem
• Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects
• Comment on Elmaghraby and Herroelen's ``The scheduling of activities to maximize the net present value of projects
• An Operation Partitioning Problem for Automated Assembly System Design
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Job Shop Scheduling by Simulated Annealing
• A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
• Optimizing Interconnections of Local Area Networks: An Approach Using Simulated Annealing
• Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
• Cash Flows in Networks
• The payment scheduling problem

This page was built for publication: Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows