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.