arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.00425cs.AI
收藏

轮胎硫化调度问题的混合优化方法

A hybrid optimization procedure for solving a tire curing scheduling problem

Joaquín Velázquez, Héctor Cancela, Pedro Piñeyro

摘要:

本文针对某轮胎厂硫化生产过程中的批量生产与调度问题进行了研究。其目的是找到生产足够的轮胎所需的最小完工时间,以满足需求的时间要求,考虑不同的资源的可用性和兼容性。为了解决这个问题,我们提出了一种混合的方法,包括在第一次应用启发式获得估计值的最大完工时间,然后求解数学模型,以确定最小值。我们注意到模型的大小(变量和约束的数量)很大程度上取决于估计的完工时间。大量的数值实验在不同的情况下,基于真实数据的混合过程的有效性进行了评估。从得到的结果,我们可以注意到,混合方法是能够实现最佳的最大完工时间的许多情况下,即使是大的,因为由启发式提供的结果允许显着减少的大小的数学模型。

英文摘要:

This paper addresses a lot-sizing and scheduling problem variant arising from the study of the curing process of a tire factory. The aim is to find the minimum makespan needed for producing enough tires to meet the demand requirements on time, considering the availability and compatibility of different resources involved. To solve this problem, we suggest a hybrid approach that consists in first applying a heuristic to obtain an estimated value of the makespan and then solving a mathematical model to determine the minimum value. We note that the size of the model (number of variables and constraints) depends significantly on the estimated makespan. Extensive numerical experiments over different instances based on real data are presented to evaluate the effectiveness of the hybrid procedure proposed. From the results obtained we can note that the hybrid approach is able to achieve the optimal makespan for many of the instances, even large ones, since the results provided by the heuristic allow to reduce significantly the size of the mathematical model.

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

↑