Optimal resource profiles for program scheduling
type: Item
instance of: scholarly article
title: Optimal resource profiles for program scheduling
zbMATH Open document ID: 0615.90069
DOI: 10.1016/0377-2217(87)90196-2
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 1987-01-01T00:00:00Z
review text: The author formulates the problem of maximizing the total net present value of a program consisting of a series of parallel projects. Each project is characterized by a total cost function and a time interval for its duration. Moreover, the completion of every set of parallel projects generates a discounted benefit. A method based on dynamic programming is proposed for solving the problem. The lack of some details concerning the method may cause that it can be obscure for less advanced readers. The described results of application seem to be very encouraging.
reviewed by: Jerzy Kamburowski
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 3997547
zbMATH Keywords: project management
zbMATH Keywords: resource allocation
zbMATH Keywords: series of parallel projects
MaRDI profile type: Publication
full work available at URL: 0377-2217(87)90196-2
OpenAlex ID: W2111700474
cites work: Q3292915
cites work: A Variational Study of Optimal Resource Profiles
cites work: Q3995886
cites work: Optimal control policies for resource allocation in an activity network
cites work: Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
cites work: Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
cites work: Q3727732
cites work: Time-Optimal Control of Resource Allocation in a Complex of Operations Framework
cites work: ON CERTAIN MODELS OF RESOURCE ALLOCATION PROBLEMS
description: scientific article; zbMATH DE number 3997547