A Constraint Programming Method for Advanced Planning and Scheduling System with Multilevel Structured Products

الملخص EN

This paper deals with the advanced planning and scheduling (APS) problem with multilevel structured products.

A constraint programming model is constructed for the problem with the consideration of precedence constraints, capacity constraints, release time and due date.

A new constraint programming (CP) method is proposed to minimize the total cost.

This method is based on iterative solving via branch and bound.

And, at each node, the constraint propagation technique is adapted for domain filtering and consistency check.

Three branching strategies are compared to improve the search speed.

The results of computational study show that the proposed CP method performs better than the traditional mixed integer programming (MIP) method.

And the binary constraint heuristic branching strategy is more effective than the other two branching strategies.