arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.05863math.OC
收藏

用GRASP方法和路径重连接最小化单机拖期工件数

Using GRASP Approach and Path Relinking to Minimize Total Number of Tardy Jobs on a Single Batch Processing Machine

Panteha Alipour

摘要:

本文研究了使延误工件总数最小化的单台批处理机排序问题。只要不违反机器的能力,机器可以同时处理多个工件作为一批。批处理时间等于批中这些作业中最大的处理时间。在批处理机上调度工件时,需要做出两个决策,即将工件分组形成批和在机器上对批排序。这两个决定是相互依赖的,因为批次的组成影响批次的处理时间。所研究的问题是NP难问题。因此,求解数学公式以找到最优解是计算密集型的。提出了一种贪婪随机自适应搜索过程(GRASP)来解决所研究的问题与任意的工件大小,任意的加工时间和任意的交货期的假设。提出了一种新的GRASP方法的构造阶段,以提高解决方案的质量。此外,提出了一个路径重连过程,以有效地解决大规模的问题。所提出的GRASP方法的性能进行评估,通过比较其结果的商业求解器(这是用来解决的数学模型)和建设启发式。实验研究表明,从GRASP方法得到的解决方案是优于商业求解器和建设启发式。

英文摘要:

This paper considers the problem of scheduling a single batch processing machine such that the total number of tardy jobs is minimized. The machine can simultaneously process several jobs as a batch as long as the machine capacity is not violated. The batch processing time is equal to the largest processing time among those jobs in the batch. Two decisions are made to schedule jobs on the batch processing machine, namely grouping jobs to form batches and sequencing the batches on the machines. Both the decisions are interdependent as the composition of the batch affects the processing time of the batch. The problem under study is NP-hard. Consequently, solving a mathematical formulation to find an optimal solution is computationally intensive. A Greedy Randomized Adaptive Search Procedure (GRASP) is proposed to solve the problem under study with the assumption of arbitrary job sizes, arbitrary processing times and arbitrary due dates. A novel construction phase for the GRASP approach is proposed to improve the solution quality. In addition, a path relinking procedure is proposed for solving large-sized problems effectively. The performance of the proposed GRASP approach is evaluated by comparing its results to a commercial solver (which was used to solve the mathematical model) and a construction heuristic. Experimental studies suggest that the solution obtained from the GRASP approach is superior compared to the commercial solver and the construction heuristic.

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

↑