Job Shop Problem is the concentrate model of many actual job shop shedule problems, and it is a typical Nondeterministic Polynomial-time hard problem.

• 作业车间调度（Job-Shop调度）问题是许多实际车间调度问题的简化模型，是一个典型的 NP-hard 问题。