首页> 外文期刊>International Journal of Production Research >A fix-and-relax heuristic for the single-item lot-sizing problem with a flow-shop system and energy constraints
【24h】

A fix-and-relax heuristic for the single-item lot-sizing problem with a flow-shop system and energy constraints

机译:用流量店系统和能量限制的单项批量问题的修复和放松启发式问题

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

摘要

This study addresses a new single-item lot-sizing problem for flow-shop configurations by integrating the capacity contract selection problem with multiple energy sources. To the best of our knowledge, this problem has never been tackled before. We introduce a mathematical model which defines optimum production plan and energy contract option regarding the objectives and constraints of the production system and energy supplier contract conditions. Since the problem is NP-Hard, a Fix-and-Relax heuristic is introduced to solve the problem. Two different relaxation procedures are applied and the performance of the solution approach is tested on randomly generated instances. It is seen that the obtained results are quite promising. The applied heuristic approach produces solutions with the optimality gap in average for the small problem sizes such as (N5_T5,N5_T7). For the larger instances, it allows to reach better results than the results obtained by commercial solvers within a shorter time.
机译:本研究通过集成多个能源的容量合同选择问题来解决流水店配置的新单项批量问题。据我们所知,这个问题从未如此以前则。我们介绍了一个数学模型,它定义了有关生产系统和能源供应商合同条件的目标和限制的最佳生产计划和能源合同选择。由于问题是NP - 硬,因此引入了一个固定和放松的启发式来解决问题。应用了两种不同的放松程序,对随机生成的实例测试了解决方案方法的性能。可以看出,获得的结果非常有前途。应用的启发式方法平均产生具有最优性差距的解决方案,例如(n5_t5,n5_t7)。对于较大的实例,它允许达到比商业求解器在较短时间内获得的结果更好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号