Optimal resource allocation under capacity-based economics and diseconomics of scope
We consider the optimal allocation of the resource of a single facility in the presence of capacity-based economies and diseconomies of scope. Factors arising, for example, from production changeover, process management, and diseconomies of scope. This setting generalizes the traditional approach to resource allocation by allowing for the effective capacity of a facility to be a (nonlinear) function of the different items produced or services delivered by the facility. We first discuss the problem setting in which the effective capacity depends on the number of tasks assigned to the facility. We also consider the more general problem setting in which capacity consumption depends on the specific set of tasks assigned to the facility. Branch-and-bound algorithms and heuristics are defined for both problem settings, and computational experience with the procedures is presented. In both settings, the algorithms are seen to effective in solving reasonably large problems to optimality, and the heuristics consistently obtain high-quality solutions to the test problems.
- OSTI ID:
- 36271
- Report Number(s):
- CONF-9408161-; TRN: 94:009753-0601
- Resource Relation:
- Conference: 15. international symposium on mathematical programming, Ann Arbor, MI (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Mathematical programming: State of the art 1994; Birge, J.R.; Murty, K.G. [eds.]; PB: 312 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Reliable task allocation in a fault-tolerant distributed system
A Multi-Objective Approach for Optimizing Edge-Based Resource Allocation Using TOPSIS