Note—On Madigan's Approach to the Deterministic Multi-Product Production and Inventory Problem
Author(s) -
Kenneth R. Baker
Publication year - 1970
Publication title -
management science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 4.954
H-Index - 255
eISSN - 1526-5501
pISSN - 0025-1909
DOI - 10.1287/mnsc.16.9.636
Subject(s) - product (mathematics) , production planning , computer science , production (economics) , mathematical optimization , heuristic , scheduling (production processes) , inventory management , operations research , single machine scheduling , job shop scheduling , operations management , mathematics , economics , schedule , geometry , macroeconomics , operating system
The deterministic multi-product single-machine production and inventory problem is one of the simplest models in which production and inventory factors interact. There is at present no algorithm available which solves the problem optimally, and several different types of approaches have been presented in the literature. Madigan's heuristic method [Madigan, J. G. 1968. Scheduling a multi-product single machine system for an infinite planning period. Management Sci. 14(11, July) 713-719.] avoided some of the drawbacks characteristic of other methods, but there are some errors and limitations in his original presentation, to which this note is addressed.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom