To solve the two-workshop integrated scheduling problem with same device resources, existing algorithms pay attention to horizontal parallel processing of process tree and ignore tightness between vertical serial processes. A algorithm for production time-selective strategy Backtracking Strategy is proposed. The order each in needs be determined, which will completed by sequence sequencing stra...

We analyze two algorithms for solving constraint satisfaction problems. One of these algorithms, Probe Order Backtracking, has an average running time much faster than any previously analyzed algorithm for problems where solutions are common. Probe Order Backtracking uses a probing assignment (a prese-lected test assignment to unset variables) to help guide the search for a solution to a constr...

ly, one possiblc3 mode of interaction bctwccn the the problLm solver and the dntn base is as follows. A list is maintained of c~cry ;\ssumptioll set disco\rcrcd to bc contradictory. Whcncvcr the problem solver discovers Iwo val~~cs with contt.adictr~ry assumptions, the combined assumption set is placed on this list, and cvcry vaIlIC b,iscd on it or any of its super sets is crascd from the daL\ ...