关键词: 多约束排序问题, 约束满足模型, 约束规划, 重构

Abstract: The multi-constrained scheduling problem is often encountered in production scheduling field, and it is difficult for traditional optimization models and methods to adapt the variable production constraints. Based on the constraint programming, the problem is defined as a constraint satisfaction problem. A refactoring model and a generalized method are proposed to solve the problem. In the generalized solving framework, the model and the algorithm are designed separately. With the constraint programming platform, an abstract constraint library for the special domain is established. According to the different production environment, by linking the constraints library the refactoring model is quickly established. The optimization model is solved by the constraint programming approach and the appropriate search algorithm. Application results show that the proposed method is versatile and the results meet the requirements of practical application.

Key words: multi-constrained scheduling problem, constraint satisfaction, constraint programming, refactoring