首页   按字顺浏览 期刊浏览 卷期浏览 FINDING PLACEMENT SEQUENCES AND BIN LOCATIONS FOR CARTESIAN ROBOTS
FINDING PLACEMENT SEQUENCES AND BIN LOCATIONS FOR CARTESIAN ROBOTS

 

作者: R. L. FRANCIS,   H. W. HAMACHER,   C-Y. LEE,   S. YERALAN,  

 

期刊: IIE Transactions  (Taylor Available online 1994)
卷期: Volume 26, issue 1  

页码: 47-59

 

ISSN:0740-817X

 

年代: 1994

 

DOI:10.1080/07408179408966584

 

出版商: Taylor & Francis Group

 

数据来源: Taylor

 

摘要:

We model the repetitive placement by a Cartesian robot of n parts on a rectangular workpiece. There are n bins or feeders (one per part), to be placed around the boundary of the workpiece, which contain the parts. The robot picks a part from a bin, places it, picks another part, places it, etc.; any placement sequence is possible. The problem, to find bin locations and a placement sequence to minimize total assembly time, is formulated as a traveling salesman problem (on a graph withnnodes) with special structure. This structure allows the computation of a lower bound on the minimum total assembly time in orderneffort. The lower bound improves as n increases, and leads to a simple solution algorithm which gives asymptotically optimal solutions in ordern log neffort. For die case where parts are uniformly distributed on the workpiece, we give simple closed-form expressions for the expected value of the lower bound. These expressions should be helpful for design decisions; for example, holding n constant, they indicate that square workpieces require more assembly time than non-square, rectangular workpieces of the same area. Most of our results are relatively insensitive to the inclusion of robot acceleration/deceleration effects.

 

点击下载:  PDF (1109KB)



返 回