On the nature and validity of the clearing function

Frontiers in Applied Mathematics and Statistics, 2026

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.3389/fams.2026.1819821
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Clearing functions are valuable tools for production planning because they capture the relationship between workload—specifically work in progress (WIP)—and expected throughput (yield). However, the use of steady-state queueing models to derive these functions is often criticized given the finite nature of actual planning periods. This study addresses this limitation by proposing a mechanistic model for a single-resource factory, drawing the Industrial-Metabolism-based analogy between machine operations and enzyme kinetics. By framing the system as a singularly perturbed model with slow (WIP) and fast (busy machines) variables, we demonstrate that the clearing function emerges as an asymptotic expansion of the slow invariant manifold. Ultimately, we demonstrate that the validity of this approximation in non-steady states depends on the ratio of active machines to WIP; a sufficiently low ratio justifies the use of clearing functions even when steady-state conditions are not met.