The multi-item joint replenishment problem is generalized to allow ordering costs to be dependent on the specific items jointly supplied. A fixed cycle approach is examined in which all the items of a group are always jointly replenished. A dynamic programming algorithm is developed for...

This paper investigates a multi-item, multi-level production scheduling problem with linear costs and production and inventory constraints at one key facility. Two multi-item problems---one in which the constraint was on shipping capability and one in which there was a final stage bottleneck...

Previous work dealt with the problems of nervousness in Material Requirements Planning (MRP) Systems when production schedules were modified to include setups which previously had not been scheduled. In this work we further examine nervousness and its cost. By modifying the setup costs used in...

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....

This paper defines a model that covers the multimachine extensions of all existing flow-shop problems with time lags as well as flow-shop problems where setup, processing and release times are separated. Approximate solutions and lower completion time bounds are developed for the restricted and...