An integrated planning approach for a nanodeposition manufacturing process

被引:0
作者
Dong Tang
Udatta S. Palekar
机构
[1] Intel Corporation,
[2] University of Illinois at Urbana-Champaign,undefined
[3] 2130 East Saltsage Drive,undefined
来源
The International Journal of Advanced Manufacturing Technology | 2010年 / 51卷
关键词
Process planning; Nanodeposition manufacturing systems; Pattern decomposition; Fluidic routing; Toolbit path planning;
D O I
暂无
中图分类号
学科分类号
摘要
This paper deals with the planning problem in a nanodeposition manufacturing process, in which a toolbit that consists of a multilayer grid of micro/nanofluidic channels is used to deposit nanoscale liquid materials to desired positions on workparts to form solid patterns. The objective is to obtain a planning procedure that achieves efficient throughput for the studied nanodeposition manufacturing systems. We break down the studied problem into several sub-problems as design pattern decomposition, nanopore assignment, liquid material routing in the multilayer grid fluidic network, and toolbit path planning. Efficient algorithms are proposed to solve these sub-problems individually, and then finally integrated into a framework that systematically plans the nanodeposition manufacturing process. A software tool that plans, simulates, and controls the nanodeposition manufacturing process by implementing the proposed algorithms is reported in this paper.
引用
收藏
页码:561 / 573
页数:12
相关论文
共 26 条
[1]  
Jarvis RA(1973)On the identification of the convex hull of a finite set of points in the plane Inf Process Lett 2 18-21
[2]  
Graham RL(1972)An efficient algorithm for determining the convex hull of a finite planar set Inf Process Lett 1 132-133
[3]  
Preparata F(1977)Convex hulls of finite sets of points in two and three dimensions Commun ACM 20 87-93
[4]  
Hong SJ(1975)On the complexity of combinatorial problems Netw 5 45-68
[5]  
Karp RM(1993)Simple algorithms for Steiner trees and paths packing problems in planar graphs CWI Q 6 219-240
[6]  
Wagner D(1980)An approximate solution for the Steiner tree problem in graphs Math Jpn 24 573-577
[7]  
Takahashi H(1981)A fast algorithm for Steiner trees Acta Informatica 15 141-145
[8]  
Matsuyama A(1974)A fundamental problem in vehicle routing Netw 4 35-64
[9]  
Kou L(1956)On the shortest spanning subtree of a graph and the traveling salesman problem In Proc Am Math Soc 7 48-50
[10]  
Markowsky G(1957)Shortest connection networks and some generalizations Bell Syst Tech J 36 1389-1401