A number of approaches to the aggregate planning problem have been proposed in the literature, yet experience suggests that industrial concerns seldom use these models in actual planning situations. This paper describes a modified random walk production-inventory heuristic for the problem which...

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

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

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

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

Notes on paper [Lee, D. R., D. Orr. 1977. Further results on planning horizons in the production smoothing problem. Management Sci. 23 (5) 490-498.] pointing to some ambiguities and errors.

A rolling schedule is formed by solving a multi-period problem and implementing only the first period's decisions; one period later the multi-period model is updated and the process repeated. In this paper, we provide a general framework for analyzing rolling schedules, and we examine...

We show that certain large, multiproduct problems can be well approximated by smaller models of the same form, representing only one aggregate product (or a few such products). This reduction follows from a new technique to approximate the minimal cost of a special allocation or "disaggregation"...