Multiperiod resource allocation with a smoothing objective

Hanan Luss and Moshe B. Rosenwein

Naval Research Logistics (NRL), 1995, vol. 42, issue 7, 1007-1020

Abstract: We consider a multiperiod resource allocation problem, where a single resource is allocated over a finite planning horizon of T periods. Resource allocated to one period can be used to satisfy demand of that period or of future periods, but backordering of demand is not allowed. The objective is to allocate the resource as smoothly as possible throughout the planning horizon. We present two models: the first assumes that the allocation decision variables are continuous, whereas the second considers only integer allocations. Applications for such models are found, for example, in subassembly production planning for complex products in a multistage production environment. Efficient algorithms are presented to find optimal allocations for these models at an effort of O(T2). Among all optimal policies for each model, these algorithms find the one that carries the least excess resources throughout the planning horizon. © 1995 John Wiley & Sons, Inc.

Date: 1995
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199510)42:73.0.CO;2-Q

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:42:y:1995:i:7:p:1007-1020

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().