Job shop scheduling problem is one of the typical combinatorial optimization problems with constraints. To get its encoding has always been one of the main and difficult points of the problem.
车间作业调度问题是一类带有约束的典型的组合优化问题，目前采用人工鱼群算法解决车间作业调度问题没有检索到参考文献。
Job-Shop scheduling problem, as the core of manufacturing business, is a class of time constraints, sequence constraints, and resource constraints of the combinatorial optimization problem.
车间调度的优化问题，作为制造企业的核心，是一类具有时间约束、次序约束以及资源约束的组合优化问题。
This is a new combinatorial optimization problem which has many applications in practice, such as in multiprocessor scheduling and real-world transportation.
该问题是一个新的组合优化问题，来源于多处理器任务调度。
Mission planning for electronic reconnaissance satellites is a challenging combinatorial optimization problem, and its scheduling model and algorithm are studied.
对电子侦察卫星任务规划模型及算法进行了研究。
Scheduling is an important combinatorial optimization problem. The modern scheduling problems that break through the various assumptions of the classical ones hold out more and more broad prospects.
排序问题是一类重要的组合优化问题，现代排序问题突破了经典排序问题的种种假设，有着越来越广阔的应用前景。
The Job shop scheduling problem is a combinatorial optimum problem that is constrained with time, sequence and resource.
车间作业调度问题是一类具有时间约束、次序约束和资源约束的组合优化问题。
The Job shop scheduling problem is a combinatorial optimum problem that is constrained with time, sequence and resource.
车间作业调度问题是一类具有时间约束、次序约束和资源约束的组合优化问题。
应用推荐