Backtracking algorithm for kind of job allocation problem
Xianghai Wang · Jisuanji gongcheng yu sheji · 2006
Backtrack programming is a well-known technique for solving combinatorial search problems.The search is organized as a multi-stage decision where,at each stage,a choice among a number of alternatives is made.Whenever it is found that the previous choices cannot possibly lead to a solution,the algorithm backtracks,that is to say,re-establishes its state exactly as it was at the most recent choice point and chooses the next untried alternative at this point.If all alternatives are tried,the algorithm backtracks to the previous choice point.A kind of job allocation problem is brought up firstly.And then an efficient algorithm is presented based on bac-ktracking algorithm.Finally,the complexity of the proposed algorithm is analyzed.Simulation results show it is effective.