The Local Search and Experiments of Job-Shop Scheduling Problem

The Job-shop Scheduling Problem is a typical scheduling problem, which is regarded as NP-hard because of its complexity. Improvement based on traditional local search methods is realized with the combination of neighborhood and critical path. Firstly, feasible solution is achieved by heuristic approaches or just randomization. Secondly, makespan optimized solution is achieved by improved local search. Finally, the improved local search method is proved effectively by experiments, moreover the searching process is visible and suits man–machine interaction.