首页> 外文期刊>RAIRO Operation Research >MIP-BASED HEURISTICS FOR MULTI-ITEM CAPACITATED LOT-SIZING PROBLEM WITH SETUP TIMES AND SHORTAGE COSTS
【24h】

MIP-BASED HEURISTICS FOR MULTI-ITEM CAPACITATED LOT-SIZING PROBLEM WITH SETUP TIMES AND SHORTAGE COSTS

机译:基于MIP的启发式方法,可解决带有设置时间和短缺成本的多项目批量生产问题

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

摘要

We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition strategy to find a feasible solution. The planning horizon is partitioned into several sub-horizons over which a freezing or a relaxation strategy is applied. Some experimental results showing the effectiveness of the approach on real-world instances are presented. A sensitivity analysis on the parameters of the heuristics is reported.
机译:我们用实际生产计划环境中出现的建立时间来解决多项目容量批量问题。需求不能积压,但可以全部或部分丢失。安全库存是要达到的目标,而不是要遵守的工业限制。问题是NP难。我们提出了一种基于规划层分解策略的混合整数规划启发式算法,以找到可行的解决方案。将计划范围划分为几个子区域,在这些子区域上应用冻结或松弛策略。给出了一些实验结果,表明该方法在实际实例中的有效性。报告了对启发式参数的敏感性分析。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号