विधियों की तुलना करें

	बाधाओं का सिद्धांत (TOC)	लिटिल का नियम (L = λW)
क्षेत्र	गुणवत्ता प्रबंधन	संचालन अनुसंधान
परिवार	Process / pipeline	Regression model
उद्भव वर्ष	1990	1961
प्रवर्तक	Eliyahu Goldratt	John D. C. Little
प्रकार	Continuous improvement framework	Exact queueing identity
मौलिक स्रोत	Goldratt, E. M. (1990). Theory of Constraints. North River Press. ISBN: 978-0-88427-166-6	Little, J. D. C. (1961). A proof for the queuing formula: L = λW. Operations Research, 9(3), 383–387.
उपनाम	TOC, Constraint Management, Bottleneck Theory, Kısıtlar Teorisi	L = λW Theorem, Little's Theorem, Little's Result, Little Yasası
संबंधित	3	3
सारांश	The Theory of Constraints (TOC) is a management philosophy and continuous improvement framework introduced by Eliyahu Goldratt in his 1984 novel The Goal and formalized in his 1990 book. TOC holds that every system has at least one constraint — a bottleneck that limits the system's overall throughput — and that systematically identifying and addressing that constraint is the most effective lever for improving performance. It is widely applied in manufacturing, project management, supply chains, and service operations.	Little's Law is a fundamental theorem in queueing theory that relates the long-run average number of items in a stable system (L) to the long-run average arrival rate (λ) and the long-run average time an item spends in the system (W), expressed as L = λW. Introduced and rigorously proved by John D. C. Little in 1961, the law holds for virtually any stable stochastic system, requiring no assumptions about arrival distributions, service distributions, or queue disciplines.