...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >Auction-based approach to resolve the scheduling problem in the steel making process
【24h】

Auction-based approach to resolve the scheduling problem in the steel making process

机译：基于拍卖的方法来解决炼钢过程中的调度问题

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Steel production is an extremely complex process and determining coherent schedules for the wide variety of production steps in a dynamic environment, where disturbances frequently occur, is a challenging task. In the steel production process, the blast furnace continuously produces liquid iron, which is transformed into liquid steel in the melt shop. The majority of the molten steel passes through a continuous caster to form large steel slabs, which are rolled into coils in the hot strip mill. The scheduling system of these processes has very different objectives and constraints, and operates in an environment where there is a substantial quantity of real-time information concerning production failures and customer requests. The steel making process, which includes steel making followed by continuous casting, is generally the main bottleneck in steel production. Therefore, comprehensive scheduling of this process is critical to improve the quality and productivity of the entire production system. This paper addresses the scheduling problem in the steel making process. The methodology of winner determination using the combinatorial auction process is employed to solve the aforementioned problem. In the combinatorial auction, allowing bidding on a combination of assets offers a way of enhancing the efficiency of allocating the assets. In this paper, the scheduling problem in steel making has been formulated as a linear integer program to determine the scheduling sequence for different charges. Bids are then obtained for sequencing the charges. Next, a heuristic approach is used to evaluate the bids. The computational results show that our algorithm can obtain optimal or near-optimal solutions for combinatorial problems in a reasonable computation time. The proposed algorithm has been verified by a case study.
机译：钢铁生产是一个极其复杂的过程，在动态环境中（经常发生干扰）确定各种生产步骤的连贯进度是一项艰巨的任务。在钢铁生产过程中，高炉连续生产铁水，然后在熔炼车间将其转变为钢水。大部分钢水通过连铸机形成大型钢坯，然后在热轧机中轧制成卷。这些过程的调度系统具有非常不同的目标和约束，并且在存在大量有关生产故障和客户请求的实时信息的环境中运行。炼钢过程（包括炼钢然后进行连续铸造）通常是钢铁生产的主要瓶颈。因此，对该过程进行全面调度对于提高整个生产系统的质量和生产率至关重要。本文解决了炼钢过程中的调度问题。使用组合拍卖过程确定获奖者的方法被用来解决上述问题。在组合拍卖中，允许对资产组合进行投标提供了一种提高资产分配效率的方式。本文将炼钢的调度问题表述为线性整数程序，以确定不同装料的调度顺序。然后获得报价以对收费进行排序。接下来，使用启发式方法评估出价。计算结果表明，我们的算法可以在合理的计算时间内获得组合问题的最优或接近最优解。案例研究验证了该算法的有效性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号