Optimal Capacity Scheduling—II

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.