首页> 外文期刊>Computers & operations research >Robust supply chain design under uncertain demand in agile manufacturing
【24h】

Robust supply chain design under uncertain demand in agile manufacturing

机译:敏捷制造中不确定需求下的稳健供应链设计

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

摘要

This paper considers a supply chain design problem for a new market opportunity with uncertain demand in an agile manufacturing setting. We consider the integrated optimization of logistics and production costs associated with the supply chain members. These problems routinely occur in a wide variety of industries including semiconductor manufacturing, multi-tier automotive supply chains, and consumer appliances to name a few. There are two types of decision variables: binary variables for selection of companies to form the supply chain and continuous variables associated with production planning. A scenario approach is used to handle the uncertainty of demand. The formulation is a robust optimization model with three components in the objective function: expected total costs, cost variability due to demand uncertainty, and expected penalty for demand unmet at the end of the planning horizon. The increase of computational time with the numbers of echelons and members per echelon necessitates a heuristic. A heuristic based on a k-shortest path algorithm is developed by using a surrogate distance to denote the effectiveness of each member in the supply chain. The heuristic can find an optimal solution very quickly in some small- and medium-size cases. For large problems, a "good" solution with a small gap relative to our lower bound is obtained in a short computational time.
机译:本文考虑了在敏捷制造环境中需求不确定的新市场机会的供应链设计问题。我们考虑与供应链成员相关的物流和生产成本的综合优化。这些问题通常发生在各种各样的行业中,包括半导体制造,多层汽车供应链和消费类设备。决策变量有两种类型:用于选择形成供应链的公司的二元变量和与生产计划相关的连续变量。情景方法用于处理需求的不确定性。该公式是一个健壮的优化模型,在目标函数中包含三个组成部分:预期总成本,由于需求不确定性导致的成本可变性以及计划期末未满足需求的预期惩罚。随着梯队和每个梯队成员的数量而增加的计算时间需要进行启发式分析。通过使用代理距离来表示供应链中每个成员的有效性,开发了一种基于k最短路径算法的启发式方法。在某些中小型情况下,启发式方法可以很快找到最佳解决方案。对于较大的问题,可以在较短的计算时间内获得相对于我们的下限具有较小差距的“良好”解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号