单吊车循环调度的统一建模框架及改进模型
A unified modeling framework and improved formulations for single-hoist cyclic scheduling
AI总结:
本文从统一视角重新审视单吊车循环调度问题,分析现有MIP模型并提出改进方法,通过实验比较不同模型的性能,提供可复现的研究资源。
摘要:
循环吊车调度问题源于电镀线,单个或多个吊车在受技术约束下运输零件。目标是确定一个循环序列,以最小化周期时间并满足行驶和处理约束。尽管该问题已广泛研究数十年,文献中不同研究对同一基准实例报告不同的最优周期时间,限制了计算结果的可比性和可复现性。本文从统一视角重新审视循环吊车调度问题的建模,引入一致的单吊车建模方法,分析文献中几种混合整数线性规划(MIP)模型,并识别建模不一致性和现有模型之间的关系。基于这些观察,我们提出简单的约束编程(CP)模型作为基线方法,并推导出改进的MIP模型。广泛的计算实验比较了所研究模型的强度和性能。为了支持可复现的研究,我们还提供了一个公开可用的库,包含基准实例和几种CP和MIP模型的实现。
英文摘要:
The cyclic hoist scheduling problem originates in electroplating lines, where a single or multiple hoists transport parts between processing tanks subject to technological constraints. The objective is typically to determine a cyclic sequence of hoist movements that minimizes the cycle time while satisfying travel and processing constraints. Although the problem has been widely studied for several decades, the literature contains a puzzling phenomenon: different studies often report different optimal cycle times for the same benchmark instances, which limits the comparability and reproducibility of computational results. In this paper, we revisit the modeling of cyclic hoist scheduling problems from a unified perspective. We introduce a consistent modeling approach for single-hoist problems and analyze several mixed-integer linear programming (MIP) formulations proposed in the literature. Our analysis identifies modeling inconsistencies and clarifies the relationships between existing formulations. Based on these observations, we propose straightforward constraint programming (CP) models that can serve as baseline approaches, and we also derive improved MIP~formulations. Extensive computational experiments compare the strength and performance of the investigated formulations. To support reproducible research, we also provide a publicly available library containing benchmark instances and implementations of several CP and MIP~formulations for single-hoist cyclic hoist scheduling.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。