Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows
type: Item
instance of: scholarly article
title: Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows
zbMATH Open document ID: 0926.90042
DOI: 10.1016/0377-2217(95)00382-7
author: Ran Etgar
author: Avraham Shtub
author: Larry J. Le Blanc
published in: European Journal of Operational Research
publication date: 1999-11-29T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1252986
zbMATH Keywords: project scheduling
zbMATH Keywords: net present value
zbMATH Keywords: simulated annealing
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00382-7
OpenAlex ID: W2021889655
cites work: Q3994799
cites work: An Operation Partitioning Problem for Automated Assembly System Design
cites work: Q3844775
cites work: Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
cites work: Q4166568
cites work: The scheduling of activities to maximize the net present value of projects
cites work: Optimizing Interconnections of Local Area Networks: An Approach Using Simulated Annealing
cites work: A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
cites work: The payment scheduling problem
cites work: Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing
cites work: Cash Flows in Networks
cites work: Comment on Elmaghraby and Herroelen's ``The scheduling of activities to maximize the net present value of projects''
cites work: Simulated annealing applied to the process allocation problem
cites work: Job Shop Scheduling by Simulated Annealing
description: scientific article; zbMATH DE number 1252986