Fast heuristic algorithm for job shop scheduling problem
- 信息技术－已发表论文 
首先将作业车间调度问题转换为一个搭积木模型,受这个直观模型的启发,提出了一个启发式的搭积木规则,该规则综合考虑了已经搭好的积木的顶高和将要搭积木的剩余高度。基于这个规则,提出了一个求解作业车间调度问题的快速启发式算法,对国际上通用的benchmark例的模拟实验结果表明,提出的算法优于经典的优先分配启发式算法。The job shop scheduling problem was transformed into one building block model. A heuristic building block rule inspired by this model was presented, which considered the top - high of block among boxes and the high of these blocks to be built. Based on this rule, a fast heuristic algorithm was developed for job shop scheduling problem. The results of the simulation study show that the presented algorithm outperforms the well - known priority dispatching rules.