Constraint-based model for the cyclic multi-hoists scheduling problem
针对表面处理车间中多台吊车共享区域且需避免碰撞的循环调度问题，提出一种结合析取约束和分支定界算法的求解方法，并用约束逻辑编程语言Prolog IV实现。
This article presents a method for the resolution of a material handling scheduling problem. The case studied is a real industrial problem. It consists of finding a cyclic schedule for hoist movements in a treatment surface shop. In this kind of facility, several hoists are used for all the handling operations and they have to share common zones. Then it is necessary to control that there is no collision. The mathematical formulation of the problem is based on a combination of disjunctive constraints. The constraints describe either movement schedule or collision avoidance. The resolution procedure presented identifies all the collision configurations and then uses a branch and bound-like algorithm to find the optimal solution of a given problem. The language chosen for our implementation is the constraint logic programming language: Prolog IV, which is able to solve constraints with rational variables. It actively uses the constraint propagation mechanism that can be found in several languages. Keywords: Cyclic SchedulingConstraint Logic ProgrammingElectroplating FacilitiesHoists