Optimal Capacity Scheduling---II

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, 533-546

Abstract: This paper is a continuation of the preceding article. When no special assumption is made about the cost coefficient c ij in the capacity scheduling model, it is necessary, as has been shown, to solve the problem by means of a transshipment linear programming model. But for a large class of real situations, the c ij can be described in terms of a specific mathematical function that leads to considerable simplifications in the solution algorithm. Here the algorithmic simplifications are explored in detail. The analysis of the capacity scheduling model is also extended to situations in which initial capacities exist, and an application of the model to the multicommodity warehousing problem is given.

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.533 (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:533-546

Access Statistics for this article

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