Job shop scheduling problem (JSSP) is a very difficult combinatorial optimization problem, which is proved to be NP-hard. It has great importance in engineering application and academic study.

• 作业车间调度问题(Job Shop Scheduling Problem,简称JSSP)是一个非常复杂的NP-难组合优化问题,它在工程应用中有着十分重要的意义。