Abstract
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 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
