Maximizing the long-run average expected profit of a periodic-review assemble-to-order system

Yaping Zhao, Xiaoyun Xu, Haidong Li
{"title":"Maximizing the long-run average expected profit of a periodic-review assemble-to-order system","authors":"Yaping Zhao, Xiaoyun Xu, Haidong Li","doi":"10.1109/COASE.2017.8256181","DOIUrl":null,"url":null,"abstract":"This study considers an assemble-to-order system with periodic-reviews and a general bill of materials. The objective is to maximize the long-run average expected profit through policies including product price and component replenishment and allocation. An upper bound on the objective for all feasible policies is established through a two-stage stochastic programme (SP) which inspires the construction of a myopic policy. Particularly, the first-stage SP solution specifies the price and replenishment decisions, while the allocation decision resembles the second-stage SP recourse solution. A lower bound on the optimal policy is also provided. Numerical experiment results demonstrate that both the upper bound and the proposed policy are effective. This study brings new perspectives to supply chain management of assemble-to-order systems and suggests ways to improve profitability.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2017.8256181","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This study considers an assemble-to-order system with periodic-reviews and a general bill of materials. The objective is to maximize the long-run average expected profit through policies including product price and component replenishment and allocation. An upper bound on the objective for all feasible policies is established through a two-stage stochastic programme (SP) which inspires the construction of a myopic policy. Particularly, the first-stage SP solution specifies the price and replenishment decisions, while the allocation decision resembles the second-stage SP recourse solution. A lower bound on the optimal policy is also provided. Numerical experiment results demonstrate that both the upper bound and the proposed policy are effective. This study brings new perspectives to supply chain management of assemble-to-order systems and suggests ways to improve profitability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使定期评审的按订单组装系统的长期平均预期利润最大化
本研究考虑具有定期审查和总物料清单的按订单组装系统。目标是通过包括产品价格和零部件补充和分配在内的政策,使长期平均预期利润最大化。通过两阶段随机规划(SP)建立了所有可行政策目标的上界,从而启发了近视政策的构建。特别是,第一阶段的SP解决方案指定了价格和补充决策,而分配决策类似于第二阶段的SP追索权解决方案。给出了最优策略的下界。数值实验结果表明,该上界和策略都是有效的。本研究为装配到订单系统的供应链管理提供了新的视角,并提出了提高盈利能力的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A study on performance evaluation and status-based decision for cyber-physical production systems Optimization of deterministic timed weighted marked graphs An optimization-simulation approach for long term care structure assignment problem for elderly people Stochastic simulation of clinical pathways from raw health databases A circuit-breaker use-case operated by a humanoid in aircraft manufacturing
×
引用
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