Production Switching Heuristics for the Aggregate Planning Problem

Joseph M. Mellichamp and Robert M. Love
Additional contact information
Joseph M. Mellichamp: University of Alabama
Robert M. Love: Army Logistics Management Center, Fort Lee

Management Science, 1978, vol. 24, issue 12, 1242-1251

Abstract: 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 should appeal to managers on the basis of simplicity as well as efficiency. The proposed approach is contrasted with linear programming, parametric programming, and linear decision rule optimal and near optimal solutions for several well known production situations. The simple production switching heuristic produces schedules which exceed optimal schedules by only 1 to 2 percent of total production costs in all cases.

Keywords: planning; production/scheduling; inventory/production: production smoothing (search for similar items in EconPapers)
Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.24.12.1242 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:24:y:1978:i:12:p:1242-1251

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().