Note—An Improved Discrete Dynamic Programming Algorithm for Allocating Resources Among Interdependent Projects
DOI10.1287/MNSC.37.9.1195zbMATH Open0745.90048OpenAlexW1989771942MaRDI QIDQ3985151FDOQ3985151
Robert L. Carraway, Robert L. Schmidt
Publication date: 27 June 1992
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.37.9.1195
Recommendations
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Boolean programming (90C09)
Cited In (11)
- An alternative efficient representation for the project portfolio selection problem
- Scheduling just-in-time part supply for mixed-model assembly lines
- An application of dynamic programming to assign pressing tanks at wineries
- Truck scheduling at zero-inventory cross docking terminals
- A new global approach for \(0\)-\(1\) polynomial programs
- Heuristics and exact algorithms for solving the Monden problem
- Genetic algorithm-based multi-criteria project portfolio selection
- Sequencing mixed-model assembly lines to minimize part inventory cost
- Scheduling inbound and outbound trucks at cross docking terminals
- Constructing strategies in strategic planning: a decision support evaluation model
- Dispersion with connectivity in wireless mesh networks
This page was built for publication: Note—An Improved Discrete Dynamic Programming Algorithm for Allocating Resources Among Interdependent Projects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3985151)