Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
type: Item
instance of: scholarly article
title: Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
zbMATH Open document ID: 0990.90058
DOI: 10.1016/S0377-2217(99)00498-1
published in: European Journal of Operational Research
publication date: 2000-12-19T00:00:00Z
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1545202
zbMATH Keywords: general temporal constraints
zbMATH Keywords: resource leveling
zbMATH Keywords: net present value
author: Klaus Neumann
author: Jürgen Zimmermann
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Q3056948
cites work: Optimal resource leveling using non-serial dynamic programming
cites work: Q3468865
cites work: Minimizing Resource Availability Costs in Time-Limited Project Networks
cites work: An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations
cites work: Q4354785
cites work: The payment scheduling problem
cites work: Project network models with discounted cash flows a guided tour through recent developments
cites work: A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows
cites work: Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
cites work: Resource levelling for projects with schedule-dependent time windows
cites work: Active and stable project scheduling
cites work: Cash Flows in Networks
cites work: Optimal resource profiles for program scheduling
cites work: A comparison of stochastic scheduling rules for maximizing project net present value
full work available at URL: s0377-2217(99)00498-1
OpenAlex ID: W2014349223
description: scientific article; zbMATH DE number 1545202