关键词: 空间布置, 动态空间调度, 深度优先搜索

Abstract: This paper proposes a dynamic spatial scheduling approach based on Tree-Search to solve the assembling spatial scheduling problem in the large-sized discrete companies. The approach considers the spatial layout and the time scheduling simultaneously, and in the whole scheduling plan period, the algorithm is divided into two parts: the first is the pre-scheduling stage, the scheduling time is separated into the continual time-slices, and the block candidate set is got via the time constraint, the initial layout status is given at the same time; the second is the partial scheduling stage, with the Depth First Search, we perform the spatial layout search by the partial schedule algorithm in every time-slice, in order to get the optimal scheduling plan. This approach is simple and useful. Finally, the simulated experiment illustrates the validity of this approach.

Key words: Spatial layout, Dynamic spatial scheduling, Depth First Search