...
首页> 外文期刊>European Journal of Operational Research >The optimal control of just-in-time-based production and distribution systems and performance comparisons with optimized pull systems
【24h】

The optimal control of just-in-time-based production and distribution systems and performance comparisons with optimized pull systems

机译:基于实时的生产和分销系统的最佳控制,以及与优化的牵引系统进行的性能比较

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

获取外文期刊封面封底 >>

       

摘要

In just-in-time (JIT) production systems, there is both input stock in the form of parts and output stock in the form of product at each stage. These activities are controlled by production-ordering and withdrawal kanbans. This paper discusses a discrete-time optimal control problem in a multistage JIT-based production and distribution system with stochastic demand and capacity, developed to minimize the expected total cost per unit of time. The problem can be formulated as an undiscounted Markov decision process (UMDP); however, the curse of dimensionality makes it very difficult to find an exact solution. The author proposes a new neuro-dynamic programming (NDP) algorithm, the simulation-based modified policy iteration method (SBMPIM), to solve the optimal control problem. The existing NDP algorithms and SBMPIM are numerically compared with a traditional UMDP algorithm for a single-stage JIT production system. It is shown that all NDP algorithms except the SBMPIM fail to converge to an optimal control. Additionally, a new algorithm for finding the optimal parameters of pull systems is proposed. Numerical comparisons between near-optimal controls computed using the SBMPIM and optimized pull systems are conducted for three-stage JIT-based production and distribution systems. UMDPs with 42 million states are solved using the SBMPIM. The pull systems discussed are the kanban, base stock, CONWIP, hybrid and extended kanban.
机译:在实时(JIT)生产系统中,在每个阶段都存在零件形式的输入库存和产品形式的输出库存。这些活动由生产订购和撤回看板控制。本文讨论了在多阶段基于JIT的具有随机需求和容量的生产和分配系统中的离散时间最优控制问题,该系统的开发目的是使单位时间的预期总成本最小化。这个问题可以用无折扣马尔可夫决策过程(UMDP)来表述。但是,维数的诅咒使得很难找到确切的解决方案。为了解决最优控制问题,作者提出了一种新的神经动态规划算法(NDP),即基于仿真的改进策略迭代方法(SBMPIM)。将现有的NDP算法和SBMPIM与用于单级JIT生产系统的传统UMDP算法进行了数值比较。结果表明,除SBMPIM之外,所有NDP算法都无法收敛到最优控制。此外,提出了一种寻找牵引系统最优参数的新算法。对于基于JIT的三阶段生产和分销系统,使用SBMPIM和优化的拉动系统计算出的接近最佳控制之间进行了数值比较。使用SBMPIM可以解决具有4,200万状态的UMDP。讨论的拉动系统是看板,基本库存,CONWIP,混合和扩展看板。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号