{"title":"Clearing function in the context of the invariant manifold method","authors":"Almaz Mustafin, Aliya Kantarbayeva","doi":"10.21638/11701/spbu10.2023.205","DOIUrl":null,"url":null,"abstract":"Clearing functions (CFs), which express a mathematical relationship between the expected throughput of a production facility in a planning period and its workload (or work-inprogress, WIP) in that period have shown considerable promise for modeling WIP-dependent cycle times in production planning. While steady-state queueing models are commonly used to derive analytic expressions for CFs, the finite length of planning periods calls their validity into question. We apply a different approach to propose a mechanistic model for one-resource, one-product factory shop based on the analogy between the operation of machine and enzyme molecule. The model is reduced to a singularly perturbed system of two differential equations for slow (WIP) and fast (busy machines) variables, respectively. The analysis of this slow-fast system finds that CF is nothing but a result of the asymptotic expansion of the slow invariant manifold. The validity of CF is ultimately determined by how small is the parameter multiplying the derivative of the fast variable. It is shown that sufficiently small characteristic ratio ’working machines: WIP’ guarantees the applicability of CF approximation in unsteady-state operation.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":"12 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21638/11701/spbu10.2023.205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Clearing functions (CFs), which express a mathematical relationship between the expected throughput of a production facility in a planning period and its workload (or work-inprogress, WIP) in that period have shown considerable promise for modeling WIP-dependent cycle times in production planning. While steady-state queueing models are commonly used to derive analytic expressions for CFs, the finite length of planning periods calls their validity into question. We apply a different approach to propose a mechanistic model for one-resource, one-product factory shop based on the analogy between the operation of machine and enzyme molecule. The model is reduced to a singularly perturbed system of two differential equations for slow (WIP) and fast (busy machines) variables, respectively. The analysis of this slow-fast system finds that CF is nothing but a result of the asymptotic expansion of the slow invariant manifold. The validity of CF is ultimately determined by how small is the parameter multiplying the derivative of the fast variable. It is shown that sufficiently small characteristic ratio ’working machines: WIP’ guarantees the applicability of CF approximation in unsteady-state operation.
期刊介绍:
The journal is the prime outlet for the findings of scientists from the Faculty of applied mathematics and control processes of St. Petersburg State University. It publishes original contributions in all areas of applied mathematics, computer science and control. Vestnik St. Petersburg University: Applied Mathematics. Computer Science. Control Processes features articles that cover the major areas of applied mathematics, computer science and control.