arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.03928cs.DS
收藏

具有能耗限制的鲁棒生产调度算法

Algorithms for robust production scheduling with energy consumption limits

István Módos, Přemysl Šůcha, Zdeněk Hanzálek

摘要:

在这项工作中,我们考虑了生产企业面临的调度问题与大的电力消耗。根据与电力公司签订的合同,生产公司有义务在规定的时间间隔内(通常为15分钟)遵守总能耗限制,否则,公司将支付大量罚款。虽然有可能设计的生产计划,考虑这些限制作为硬约束,在执行计划过程中发生的不确定性通常不考虑。这可能导致操作的意外延迟导致违反能量消耗限制的情况。我们的目标是设计强大的生产计划,积极主动地保证能源消耗限制不违反给定的一组不确定性的情况下。我们考虑在一台机器上的调度与释放时间的操作和总拖期为目标函数。为了解决这个问题,我们首先提出了一个伪多项式算法找到最佳的鲁棒调度给定的置换的操作。该算法,然后利用三种不同的算法,找到最佳的置换:两个确切的(分支定界和基于逻辑的Benders分解)和一个启发式算法(禁忌搜索)。所有的算法进行了实验评估的随机实例与不同大小的不确定性场景集。使用禁忌搜索算法,我们能够在一分钟内解决大型实例。

英文摘要:

In this work, we consider a scheduling problem faced by production companies with large electricity consumption. Due to the contract with the electric utility, the production companies are obligated to comply with the total energy consumption limits in the specified time intervals (usually 15-minutes long), otherwise, the companies pay substantial penalty fees. Although it is possible to design production schedules that consider these limits as hard constraints, uncertainties occurring during the execution of the schedules are usually not taken into account. This may lead to situations in which the unexpected delays of the operations cause the violations of the energy consumption limits. Our goal is to design robust production schedules pro-actively guaranteeing that the energy consumption limits are not violated for the given set of uncertainty scenarios. We consider scheduling on one machine with release times of the operations and total tardiness as the objective function. To tackle this problem, we first propose a pseudo-polynomial algorithm for finding the optimal robust schedule for the given permutation of the operations. This algorithm is then utilised in three different algorithms for finding the optimal permutation: two exact (Branch-and-Bound and logic-based Benders decomposition) and one heuristic algorithm (tabu search). All the algorithms were experimentally evaluated on random instances with different sizes of the uncertainty scenarios set. Using the tabu search algorithm, we are able to solve large instances within one minute.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑