Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2014 (2014), Article ID 917685, 7 pages
Research Article

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

1School of Management, Shanghai University, Shanghai 200444, China
2Wenzhou University, Wenzhou, Zhejiang 325035, China

Received 5 July 2013; Revised 6 November 2013; Accepted 3 December 2013; Published 2 January 2014

Academic Editor: Tinggui Chen

Copyright © 2014 Yunfang Peng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.