The cyclic hoist scheduling problem (CHSP) is a well-studied optimisation problem due to its importance in industry. Despite the wide range of solving techniques applied to the CHSP and its variants, the models have remained complicated and inflexible, or have failed to scale up with larger problem instances. This article re-examines modelling of the CHSP and proposes a new simple, flexible constraint programming formulation. We compare current state-of-the-art solving technologies on this formulation, and show that modelling in a high-level constraint language, MiniZinc, leads to both a simple, generic model and to computational results that outperform the state of the art. We further demonstrate that combining integer programming and lazy clause generation, using the multiple cores of modern processors, has potential to improve over either solving approach alone.

循环提升调度问题（CHSP）由于其在工业中的重要性而已成为研究充分的优化问题。尽管将广泛的求解技术应用于CHSP及其变体，但是这些模型仍然复杂且缺乏灵活性，或者无法随着较大的问题实例进行扩展。本文重新检查了CHSP的建模，并提出了一种新的简单，灵活的约束编程公式。我们在此公式上比较了当前的最新解决方案技术，并表明使用高级约束语言MiniZinc进行建模既可以生成简单的通用模型，也可以提供优于现有技术的计算结果。我们进一步证明，使用现代处理器的多个内核，将整数编程和惰性子句生成结合起来，