三维装箱工作的优化调度问题  

Optimal time scheduling of three-dimensional space packing

作　　者：黄文奇[1] 何琨[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2010年第12期102-104,共3页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(60773194)

摘　　要：提出了如下关于时空充分利用的三维空间中的长方体装箱工作的调度问题:已知一个形状大小任意给定的长方体形的箱子和有限个形状大小分别任意给定的长方体形的物体,又知每个物体须在箱中连续烘烤的时间长度,考虑应如何安排每个物体的入箱时刻,以及至出箱前这段时间内它在每个时刻上的位置和方向,才能使得整个箱子的被使用时间最少.与经典装箱问题的不同之处在于,各物体在箱子内可以改变其位置和方向.正因为如此,按本数学模型,四维时空才可以得到更真实、更充分的利用.A problem of the four-dimensional space-time＇s efficient packing and scheduling was proposed in this paper.Given a cuboid container and a set of cuboid items,the time that each item was baked continuously in the container was given too,the problem was how to arrange each item＇s loading time,and the location and orientation of each loaded item at each time before the item could be taken out.The purpose was that the total used time of the container was minimized.Differing from classical packing problems,the location and orientation of items could be changed in the container.Therefore,the four-dimensional space-time could be utilized more truly and more fully.

关 键 词：布局问题 优化 装箱 调度 四维时空 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]