In this paper, we analyze how a supplier can structure the terms of an optimal quantity discount schedule. The vendor's challenge is to adjust his present pricing schedule to entice his major customer to increase his present order size by a factor of "K." Optimal levels for "K" and the...

In this paper we consider a certain aggregate production planning model. This model permits regular and overtime production and allows for backordering of goods for a number of periods. Although the discussed model can be formulated as a linear programming problem a special (noniterative) method...

This paper presents a dynamic programming algorithm for simultaneous determination of production batch sizes in an assembly network and distribution batch sizes in a conjoined distribution ("arborescent") network. The objective is to minimize average cost per period over an infinite horizon....

In this paper, we deal with the two-product, single-machine, static demand, infinite horizon lot scheduling problem. After a quick review of the literature, the necessary and sufficient conditions for feasibility are derived without imposing any preliminary requirements. Then, an optimal...

The proof of a well known theorem by Crowston and Wagner in Crowston, Wagner, and Williams (Crowston, W. B., M. H. Wagner, J. F., Williams. 1973. Economic lot size determination in multi-stage assembly systems. Management Sci. 19 (5, January) 517--527.) is shown here to be defective. According...

Schwarz and Schrage's model assumes that, for optimal policies in a multi-echelon production/inventory system, the lot size of a stage must not be larger than that of a predecessor stage, as lots move from the initial stage to the final stage. Examples in this Note illustrate that set-up costs...

To satisfy the diverse information needs of federal courts, a family of information management systems was developed, based upon formal mathematical models of judicial case processing embedded in interactive data base information systems for case tracking and caseload management. These case...

Seven heuristic algorithms are discussed. Each can be used for production scheduling in an assembly network (a network where each work station has at most one immediate successor work station, but may have any number of immediate predecessor work stations), distribution scheduling in an...

A class of production planning problems is considered in which known demands have to be satisfied over a finite horizon at minimum total costs. For each period, production and storage cost functions are specified. The production costs may include set-up costs and the production levels may he...

We are concerned with scheduling several products that, require processing or a single machine. Routine application of the economic lot size formula to each product separately, often yields an infeasiable schedule in the sense that there are times when it specifies simultaneous production of two...