In a previous paper in this journal, Luebbe and Finch (1992) compared the theory of constraints (TOC) and linear programming (LP) using the five-step improvement process in TOC. This paper clarifies some of their results. Specifically, by modifying their example we show that some of their conclusions are not generalizable. Further it is shown that using LP is preferable to the $ return/constraint unit method in helping increase throughput and the reasons for this are discussed. Thus LP is a useful tool in the TOC analysis.
No takes yet. Share an insight, caveat, or question.
Balakrishnan et al. (2000) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: