pub struct LittlesLaw { /* private fields */ }Expand description
Little’s Law: The fundamental equation relating WIP, throughput, and cycle time.
L = λW where:
- L: Average number of items in the system (WIP)
- λ: Average arrival rate (throughput at steady state)
- W: Average time an item spends in the system (cycle time)
This law holds for ANY stable queueing system regardless of arrival distribution, service distribution, or queue discipline. It is one of the most fundamental results in queueing theory.
Implementations§
Source§impl LittlesLaw
impl LittlesLaw
Trait Implementations§
Source§impl Clone for LittlesLaw
impl Clone for LittlesLaw
Source§fn clone(&self) -> LittlesLaw
fn clone(&self) -> LittlesLaw
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for LittlesLaw
impl Debug for LittlesLaw
Source§impl Default for LittlesLaw
impl Default for LittlesLaw
Source§impl GoverningEquation for LittlesLaw
impl GoverningEquation for LittlesLaw
Source§fn class(&self) -> EquationClass
fn class(&self) -> EquationClass
Get the equation’s classification.
Source§fn variables(&self) -> Vec<EquationVariable>
fn variables(&self) -> Vec<EquationVariable>
Get all variables in this equation.
Source§fn description(&self) -> &str
fn description(&self) -> &str
Get a human-readable description.
Auto Trait Implementations§
impl Freeze for LittlesLaw
impl RefUnwindSafe for LittlesLaw
impl Send for LittlesLaw
impl Sync for LittlesLaw
impl Unpin for LittlesLaw
impl UnsafeUnpin for LittlesLaw
impl UnwindSafe for LittlesLaw
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more