用效率调度算法求解非标准作业车间调度问题

Solving Nonstandard Job-Shop Scheduling Problem by Efficience Scheduling Algorithm

作业车间调度问题是一类具有次序约束和资源约束的较大规模的组合优化问题 ,本文所描述的非标准作业车间调度问题 ,放宽了资源约束的条件 ,具有更大的寻优空间。针对这种复杂的组合优化问题 ,本文构造了相应的目标函数并提出一种效率调度算法来求解此问题 ,经分析和实践验证 ,获得了满意的结果。

Job-Shop scheduling problem (JSSP) is a class of larger combining optimization problem with sequence and resource constraints, in this paper nonstandard Job-Shop scheduling problem (NJSSP) is presented which slacks the resource constraints, and gets larger search space. As to this complicated combining optimization problem, the associating objective function and an algorithm by using queue are constructed. With the simulation result, the algorithm presented in this paper is proved very powerful.