Job-shop Scheduling Problem is a typical NP problems, which is one of the hardest combinatorial optimization problem.

• 作业车间调度问题是一个典型的NP难问题，是最困难的组合优化问题之一。