清除函数上下文中的不变流形方法

IF 0.3 Q4 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Almaz Mustafin, Aliya Kantarbayeva
{"title":"清除函数上下文中的不变流形方法","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":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":null,\"pages\":null},\"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}","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

摘要

清算函数(CFs)表示计划期间生产设备的预期吞吐量与该期间的工作量(或在制品,WIP)之间的数学关系,对于在生产计划中建模依赖于WIP的周期时间显示出相当大的希望。虽然稳态排队模型通常用于导出cf的解析表达式,但规划周期的有限长度使其有效性受到质疑。基于机器操作与酶分子的类比,我们采用不同的方法,提出了一种一资源一产品工厂车间的机理模型。该模型被简化为由两个微分方程组成的奇异摄动系统,这两个微分方程分别是慢(在制品)变量和快(繁忙机器)变量。对该慢-快系统的分析发现,CF只不过是慢不变流形渐近展开的结果。CF的有效性最终取决于参数乘以快速变量的导数有多小。结果表明,足够小的特征比“working machines: WIP”保证了CF近似在非稳态运行中的适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Clearing function in the context of the invariant manifold method
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.30
自引率
50.00%
发文量
10
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信