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

Table 4

Comparison of the search results of three branching strategies.

Problem type	Branch strategy
	1		2		3
	Computation time (s)	Backtracks	Computation time (s)	Backtracks	Computation time (s)	Backtracks
a-1	0.05	1166	0.122	3601	0.132	3601
a-2	0.02	492	0.08	1762	0.09	1862
a-3	0.03	798	0.099	2499	0.112	2499
b-1	0.488	5369	0.897	7354	10.023	39392
b-2	1000+	100000+	1000+	100000+	1000+	100000+
b-3	3.596	12359	5.691	17316	1000+	100000+
c-1	16.529	16522	26.253	56329	46.639	92853
c-2	5.712	10636	1000	100000+	36.952	89352
c-3	1000+	100000+	1000	100000+	1000+	100000+