基于分解策略,将船体曲面分段空间调度问题划分为一系列分段排序和分段填空过程.分段排序是根据排序规则产生待调度的分段序列;分段填空是对按一定次序进入平台的分段,应用定位放置规则和配置空间理论搜索分段可放置空域,研究采用搭界、剩余加工时间相近搭边等定位规则,确定分段在平台上的位置坐标和开工时间.仿真实验结果表明,该算法在运算结果和运算时间方面优于已提出的三维装箱问题算法.
Hull curved block spatial scheduling problem was divided into a series of block sequencing problems and block packing problems by means of decomposition strategy. Firstly, block candidates are generated as unscheduled blocks according to sequencing rules, and then feasible allocation space can be found in block packing stage. In details, spatial coordinate of each block in the working plate is obtained through location rules including boundary-adjacent, edge-adjacent of blocks with approximately similar remaining processing time, and the starting time is determined as well. Finally, an actual example was developed to validate the proposed algorithm, and the result shows the algorithm is superior to the 3-dimensional binpacking algorithm.