首页> 外文期刊>European Journal of Operational Research >Optimal models for a multi-stage supply chain system controlled by kanban under just-in-time philosophy
【24h】

Optimal models for a multi-stage supply chain system controlled by kanban under just-in-time philosophy

机译:在即时理念下看板控制的多阶段供应链系统的最优模型

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

摘要

This research studies a multi-stage supply chain system that operates under a JIT (just-in-time) delivery policy. Kanbans play an important role in the information and material flows in a supply chain system. Thus, a kanban mechanism is employed to assist in linking different production processes in a supply chain system to implement the scope of JIT philosophy. For a multi-stage supply chain system, a mixed-integer nonlinear programming (MINLP) problem is formulated from the perspective of JIT delivery policy where a kanban may reflect to a transporter such as a truck or a fork-lifter. The number of kanbans, the batch size, the number of batches and the total quantity over one period are determined optimally. It is solved optimally by branch and bound method. A greedy heuristic to avoid the large computational time in branch-and-bound algorithm is developed for solving a large MINLP. Coupled with plant-wide efforts for cost control and management commitment, a logistic system for controlling the production as well as the supply chain is built, which results in minimizing the total cost of the supply chain system. The results show that the improvements in reduction of inventory, wasted labor and customer service in a supply chain are significantly accomplished through the kanban mechanism. (C) 2004 Elsevier B.V. All rights reserved.
机译:这项研究研究了在JIT(即时)交付策略下运行的多阶段供应链系统。看板在供应链系统中的信息和物料流中扮演重要角色。因此,采用了看板机制来协助将供应链系统中的不同生产过程联系起来,以实现JIT哲学的范围。对于多级供应链系统,从JIT交付策略的角度提出了混合整数非线性规划(MINLP)问题,其中看板可能会反映给运输工具,例如卡车或叉车。最佳确定看板的数量,批次大小,批次的数量和一个时期的总量。它是通过分支定界方法来优化求解的。为了解决较大的MINLP问题,开发了一种贪婪启发式算法来避免分支定界算法中的大量计算时间。结合全厂范围内的成本控制和管理承诺,建立了用于控制生产和供应链的物流系统,从而使供应链系统的总成本降至最低。结果表明,通过看板机制,在减少供应链中的库存,减少浪费的劳动和改善客户服务方面取得了明显的进步。 (C)2004 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号