AbstractThis paper describes a manual algorithm for determining optimal production schedules when there are linear costs associated with production and storage, demand is deterministic and there is no backlogging. The method is described for use in the one-product, one-line situation and extended for use in the multiproduct, one-line situation. Examples of the method, using work sheets, are given. A comparison is made with the formulation and solution of this problem using the transportation method of linear programming. The situation in which implementation took place is described, from which conclusions are drawn in relation to the use of this method in practice.