The job-shop scheduling research belongs to the combination optimization category, it is the typical NP difficult question, its research has great theory significance and practical significance.
车间作业调度研究属于组合优化范畴，是典型的NP难问题，对它的研究具有重大的理论意义和现实意义。
The job-shop scheduling research belongs to the combination optimization category, it is the typical NP difficult question, its research has great theory significance and practical significance.
车间作业调度研究属于组合优化范畴，是典型的NP难问题，对它的研究具有重大的理论意义和现实意义。
应用推荐