首页> 外文OA文献 >Robust Production Plan with Periodic Order Quantity under Uncertain Cumulative Demands
【2h】

Robust Production Plan with Periodic Order Quantity under Uncertain Cumulative Demands

机译:不确定累积需求下具有定期订单数量的鲁棒生产计划

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In this paper, we are interested in a production planning process in collaborative supply chains. More precisely, we consider supply chains, where actors use Manufacturing Resource Planning process (MRPII). Moreover, these actors collaborate by sharing procurement plans.We focus on a supplier, who applies the Periodic Order Quantity (POQ) rule to plan a production integrating the uncertain procurement plan sent by her/his customer. The uncertainty of the procurement plan is expressed by closed intervals on the cumulative demands. In order to choose a robust production plan, under the interval uncertainty representation, the min-max criterion is applied. We propose algorithms for determining the set of possible costs of a given production plan - due to the uncertainty on the cumulative demands.We then construct algorithms for computing a robust production plan with respect to the min-max criterion: the algorithm based on iterative adding constraints and the polynomial algorithms under certain realistic assumptions.
机译:在本文中,我们对协作供应链中的生产计划过程感兴趣。更确切地说,我们考虑供应商,其中参与者使用制造资源计划流程(MRPII)。此外,这些参与者通过共享采购计划进行协作。我们关注供应商,该供应商应用定期订单数量(POQ)规则来计划其客户发送的不确定采购计划的生产。采购计划的不确定性以累计需求的封闭间隔表示。为了选择鲁棒的生产计划,在区间不确定性表示下,应用了最小-最大准则。由于累积需求的不确定性,我们提出了确定给定生产计划可能成本集合的算法,然后构造了针对最小-最大准则计算鲁棒生产计划的算法:基于迭代加法的算法约束和某些现实假设下的多项式算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号