现代制造工程 ›› 2017, Vol. 440 ›› Issue (5): 55-58.doi: 10.16731/j.cnki.1671-3133.2017.05.011

• 增材制造 • 上一篇    下一篇

考虑打印件排布的3D打印批次规划

郝南海   

  1. 北京信息科技大学机电工程学院,北京 100192
  • 收稿日期:2016-05-10 出版日期:2017-05-20 发布日期:2018-01-08
  • 作者简介:郝南海,教授,主要研究方向为工业工程、车间调度及先进制造技术。E-mail:n.hao@bistu.edu.cn
  • 基金资助:
    北京市自然科学基金项目(3082007)

Batch scheduling of 3D printing based on work-piece layout

Hao Nanhai   

  1. School of Mechanical Engineering,Beijing Information Science & Technology University,
    Beijing 100192,China
  • Received:2016-05-10 Online:2017-05-20 Published:2018-01-08

摘要: 针对3D打印批次规划问题,提出一种考虑打印件排布的3D打印批次规划方法。根据3D打印工艺特点,批次规划目标设定为总打印批次及各批次内打印件高度差值最小化。采用顺序编码方式对打印件进行编号,由全部打印件编号组成的整数序列构成问题的可行解集。解码时根据编码顺序将打印件排布于打印机工作台面,当前台面再无法排入时开始下一打印批次排布,从而得到打印批次方案及优化目标函数值。通过预先求得各打印件水平面投影形状的最小包络矩形,将二维形状排布问题简化为矩形排布问题。采用最低水平线法和Bottom-Left规则进行矩形排布,排布过程中重复寻找并更新已排件区域最高轮廓线中的最低水平线段。使用遗传算法搜索问题的最优解,通过算例验证了所提方法的有效性。

关键词: 作业调度, 3D打印, 遗传算法, 批次规划, 排样

Abstract: For the problem of batch planning of 3D printing,a method based on work-piece layout was proposed.According to the features of 3D printing process,the objective of batch planning was set to minimize the total printing batches and the height difference of the printing parts in each batch.The printed parts were coded with integer numbers in sequence and the permutations of the sequence number formed the feasible solution set of the problem.In decoding stage,the printed parts were laid into the machine’s printing table orderly according to the sequence of solution.If the machine’s printing table was not with enough space to accommodate the printed parts further more,the next printing batch was arranged.This finally reached the printing batch scheme as well as the value of optimization objective function.For simplification,the minimum bounding rectangle of the horizontal projection shape of the printed part was adopted in part laying.Thus the problem of two-dimensional shape layout was simplified as the problem of rectangular packing.The lowest horizontal line algorithm and the Bottom-Left rule were applied in the rectangular packing.The lowest horizontal line segment of packed area contour was searched and updated repeatedly during part laying until the part could not be accommodated any more.The genetic algorithm was applied in searching the optimum solution.The proposed method of this paper was verified by example.

Key words: job scheduling, 3D printing, genetic algorithm, batch planning, layout

中图分类号: 


版权所有 © 《现代制造工程》编辑部 
地址:北京市东城区东四块玉南街28号 邮编:100061 电话:010-67126028 电子信箱:2645173083@qq.com
本系统由北京玛格泰克科技发展有限公司设计开发 技术支持:support@magtech.com.cn
访问总数:,当日访问:,当前在线: