首页> 外文期刊>International Journal of Production Research >A data-driven approach to multi-product production network planning
【24h】

A data-driven approach to multi-product production network planning

机译:一种数据驱动的多产品生产网络规划方法

获取原文
获取原文并翻译 | 示例
       

摘要

The clearing function models the non-linear relationship between work-in-process and throughput and has been proposed for production planning in environments with queuing (congestion) effects. One approach in multi-product, multi-stage environments has been to model the clearing function at the bottleneck machine only. However, since the bottleneck shifts as the product release mix changes, this approach has its limitations. The other approach is the Alternative Clearing Function formulation, where the clearing function is first estimated at the resource level using piecewise linear regression from simulation experiments, and then embedded into a linear programme. This paper develops an alternative to the Allocated Clearing Function formulation, wherein system throughput is estimated at discrete work-in-process points. A mixed integer programming formulation is then presented to use these throughput estimates for discrete release choices. The strength of the formulation is illustrated with a numerical example and the new approach is compared with the ACF.
机译:清除功能可以模拟在制品与产量之间的非线性关系,并已提出用于具有排队(拥塞)效应的环境中的生产计划。在多产品,多阶段环境中,一种方法是仅在瓶颈机器上对清除功能进行建模。但是,由于瓶颈随着产品发布组合的变化而变化,因此这种方法有其局限性。另一种方法是替代清算函数公式化,其中清算函数首先使用来自模拟实验的分段线性回归在资源级别进行估计,然后嵌入到线性程序中。本文开发了分配清算功能公式的替代方法,其中系统吞吐量是在离散的在制品位置上估算的。然后提出一种混合整数编程公式,以将这些吞吐量估算值用于离散发行选择。通过数值示例说明了配方的强度,并将新方法与ACF进行了比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号