Optimal Capacity Scheduling---I

Arthur F. Veinott and Harvey M. Wagner
Additional contact information
Arthur F. Veinott: Stanford University, California
Harvey M. Wagner: Stanford University, California

Operations Research, 1962, vol. 10, issue 4, 518-532

Abstract: Efficient algorithms are developed optimizing an important class of capacity scheduling models. The specific problem considered can be simply described in terms of contracting for warehousing capacity. Contracts must be let for warehouse capacity over n time periods, with the minimum capacity to be provided in each time period being specified. Savings may be achieved by long-term leasing arrangements or by contracting at favorable periods of time, even though this creates idle capacity at certain time periods. A minimum cost solution to this problem is sought. The mathematical model also applies to problems of equipment replacement and overhaul, checkout, repair, and replacement of stochastically failing equipment, determination of economic lot size, product assortment, and deterministic batch queuing policies, labor-force planning, and multi-commodity warehouse decisions. For some of these problems, such as equipment replacement, the computing algorithms presented are even more efficient than schemes heretofore proposed for simpler versions of the same problem.

Date: 1962
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.10.4.518 (application/pdf)

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:inm:oropre:v:10:y:1962:i:4:p:518-532

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().