关键词: 作业车间调度, 启发式, 优先分配规则

Abstract: 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.

Key words: job shop scheduling, heuristic, priority dispatching rules