首页> 外文期刊>Omega >A new hybrid heuristic algorithm for the Precedence Constrained Production Scheduling Problem: A mining application
【24h】

A new hybrid heuristic algorithm for the Precedence Constrained Production Scheduling Problem: A mining application

机译:一种新的混合启发式算法,用于优先约束的生产调度问题:矿业应用

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

摘要

In this work we address the Precedence Constrained Production Scheduling Problem (PCPSP), the problem of scheduling tasks in such a way that total profit is maximized, while satisfying conditions such as precedence constraints among tasks and side constraints. A motivation for addressing this problem comes from open-pit mining industry, where the PCPSP seeks to maximize the net present value of an ore deposit by selecting the blocks (tasks) to extract, their extraction periods and their processing options, while satisfying constraints as precedences among blocks, limited availability of operational resources and maximum and/or minimum allowable concentrations of ore-grade or pollutants. Since real-world models have millions of blocks and constraints, the monolithic problem is computationally intractable. This article presents a hybrid heuristic algorithm that combines a rolling horizon decomposition with a block preselection procedure, allowing near-optimal solutions to be quickly determined. The proposed heuristic was tested on all the PCPSP instances of the MineLib library and has shown a significant improvement over the previous reported results. Moreover, a good feasible solution has been found for the instance W23, for which no solution has been previously reported. (C) 2019 Elsevier Ltd. All rights reserved.
机译:在这项工作中,我们解决了优先限制的生产调度问题(PCPSP),以这样的方式调度任务的问题最大化,同时满足任务和侧约束之间的优先约束等条件。解决这个问题的动机来自露天挖掘矿业,PCPSP通过选择块(任务)来提取,提取期间及其加工选项,同时满足限制来最大限度地提高矿石存款的净现值。块间​​的优先义,可行性资源的可用性和最大和/或最小允许浓度的矿石等级或污染物。由于现实世界模型具有数百万个块和约束,因此整体问题是计算难以解决的。本文介绍了一种混合启发式算法,将滚动地平线分解与块预选过程相结合,允许快速确定近最佳解决方案。拟议的启发式在Minelib图书馆的所有PCPSP实例上进行了测试,并显示出对先前报告的结果的显着改进。此外,已经找到了对实例W23的良好可行解决方案,其中没有先前报道过解决方案。 (c)2019 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号