Dynamic Programming Model for Cellular Manufacturing Layout under Demand Uncertainty

Kanchala Sudtachat
{"title":"Dynamic Programming Model for Cellular Manufacturing Layout under Demand Uncertainty","authors":"Kanchala Sudtachat","doi":"10.1109/ICITM48982.2020.9080361","DOIUrl":null,"url":null,"abstract":"The cellular manufacturing layout as the production management effects to increase the performance of the systems. The research area is to study the machines and parts clusters to allocate to layout locations under uncertainty. The layouts need to design to capture the realistic probability of demands. This paper, we addresses the discrete random probability of demands in cellular manufacturing system under multiple routes of parts. The objective is to minimize the expected total moving times of the material movement flow for the production lines. We formulate the dynamic programming model as a finite horizons. We investigate the model using the random data. Numerical examples are solved and presents the results of the sensitivity analysis. Finally, the model considers the demand fluctuation makes decision of the machine layout flexibility for high efficiency of the layout optimization problem.","PeriodicalId":176979,"journal":{"name":"2020 9th International Conference on Industrial Technology and Management (ICITM)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 9th International Conference on Industrial Technology and Management (ICITM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITM48982.2020.9080361","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The cellular manufacturing layout as the production management effects to increase the performance of the systems. The research area is to study the machines and parts clusters to allocate to layout locations under uncertainty. The layouts need to design to capture the realistic probability of demands. This paper, we addresses the discrete random probability of demands in cellular manufacturing system under multiple routes of parts. The objective is to minimize the expected total moving times of the material movement flow for the production lines. We formulate the dynamic programming model as a finite horizons. We investigate the model using the random data. Numerical examples are solved and presents the results of the sensitivity analysis. Finally, the model considers the demand fluctuation makes decision of the machine layout flexibility for high efficiency of the layout optimization problem.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
需求不确定条件下元胞制造布局的动态规划模型
单元制造布局作为生产管理的有效手段,提高了系统的性能。研究的领域是在不确定的情况下,机器和零件集群分配到布局位置的问题。布局的设计需要捕捉需求的现实可能性。本文研究了元胞制造系统在零件多路径下需求的离散随机概率问题。目标是最小化生产线物料移动流程的预期总移动时间。我们将动态规划模型表述为有限视界。我们用随机数据来研究这个模型。对数值算例进行了求解,并给出了灵敏度分析的结果。最后,该模型考虑了需求波动对机床布局灵活性的决策,实现了布局优化问题的高效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Overview of Lean Production and Industry 4.0 in Different Context Digitization Model for Reducing Costs and Operating Times in Peruvian Banks Dynamic Programming Model for Cellular Manufacturing Layout under Demand Uncertainty A Study of Production Planning Based on the Linear Programming Method 2020 9th International Conference on Industrial Technology and Management
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1