Theory of constraints and linear programming: a re-examination - Discussion

被引：34

作者：

Balakrishnan, J ^{[1
]}

Cheng, CH

机构：

[1] Univ Calgary, Fac Management, Operat Management Area, Calgary, AB T2N 1N4, Canada

[2] Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Shatin, Hong Kong, Peoples R China

来源：

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 2000年 / 38卷 / 06期

关键词：

Compendex;

D O I：

10.1080/002075400188951

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

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.

引用

页码：1459 / 1463

页数：5