Resource allocation via dynamic programming in activity networks
Article Abstract:
Dynamic programming (DP) is applied to the solution of the problem of resource allocation in a project. This is based on the assumption that a correlation exists between the amount of resource allocated to a project and its length of completion. The applicability of DP to the problem stems from the development of a methodology that gives the minimum number of nodes to be reduced in activity network. Nevertheless, DP retains its dimensionality despite its simplification.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1993
User Contributions:
Comment about this article or add new information about this topic:
Asymptotic analysis of dichotomous search with search and travel costs
Article Abstract:
Several simple approximations to the optimal policy are analyzed to determine the optimal sequence of queries for a dichotomous search with search and travel costs considered. A comparison of theapproximations with the optimal policy shows that the fixed-step and myopic policies yield better results than the fixed-ratio policy at middle ranges. However, all three policies yield near-optimal results for both large and very small ratios.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
Lexicographic local search and the p-centre problem
Article Abstract:
A local strategy that suits combinatorial optimization problems with a min-max (or max-min) objective was introduced. The lexicographic local search, motivated by both worst-case analysis and numerical results, is applied to the p-center problem.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2003
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: A linear algebraic formulation of the performance sensitivities of queueing networks. The heavy-traffic bottleneck phenomenon under splitting and superposition
- Abstracts: Solutions for the constrained dynamic facility layout problem. A nonlinear optimization approach for solving facility layout problems
- Abstracts: Solutions for the constrained dynamic facility layout problem. part 2 Optimal stopping problem with double reservation value property
- Abstracts: Critical transition: US and China should refocus on long-term interests. Between two giants
- Abstracts: Zone shapes in class based storage and multicommand order picking when storage/retrieval machines are used. Storage layout of AS/RS racks based on recurrent orders