Optimal resource profiles for program scheduling (Q1821025)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3997547
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal resource profiles for program scheduling |
scientific article; zbMATH DE number 3997547 |
Statements
Optimal resource profiles for program scheduling (English)
0 references
1987
0 references
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.
0 references
project management
0 references
resource allocation
0 references
series of parallel projects
0 references
0 references
0 references
0.6944829225540161
0 references
0.6944829225540161
0 references
0.6919101476669312
0 references
0.6841696500778198
0 references
0.6841696500778198
0 references
