Sequencing and scheduling in robotic cells: Recent developments

被引:162
作者
Dawande, M
Geismar, HN
Sethi, SP
Sriskandarajah, C
机构
[1] Univ Texas, Sch Management, Richardson, TX 75083 USA
[2] Prairie View A&M Univ, Coll Business, Prairie View, TX 77446 USA
关键词
manufacturing; robotic cell; cyclic solutions; flexible manufacturing;
D O I
10.1007/s10951-005-2861-9
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A great deal of work has been done to analyze the problem of robot move sequencing and part scheduling in robotic flowshop cells. We examine the recent developments in this literature. A robotic flowshop cell consists of a number of processing stages served by one or more robots. Each stage has one or more machines that perform that stage's processing. Types of robotic cells are differentiated from one another by certain characteristics, including robot type, robot travel-time, number of robots, types of parts processed, and use of parallel machines within stages. We focus on cyclic production of parts. A cycle is specified by a repeatable sequence of robot moves designed to transfer a set of parts between the machines for their processing. We start by providing a classification scheme for robotic cell scheduling problems that is based on three characteristics: machine environment, processing restrictions, and objective function, and discuss the influence of these characteristics on the methods of analysis employed. In addition to reporting recent results on classical robotic cell scheduling problems, we include results on robotic cells with advanced features such as dual gripper robots, parallel machines, and multiple robots. Next, we examine implementation issues that have been addressed in the practice-oriented literature and detail the optimal policies to use under various combinations of conditions. We conclude by describing some important open problems in the field.
引用
收藏
页码:387 / 426
页数:40
相关论文
共 82 条
[1]   Part sequencing in three-machine no-wait robotic cells [J].
Agnetis, A ;
Pacciarelli, D .
OPERATIONS RESEARCH LETTERS, 2000, 27 (04) :185-192
[3]   Cycle-time improvements for photolithography process in semiconductor manufacturing [J].
Akçali, E ;
Nemoto, K ;
Uzsoy, R .
IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, 2001, 14 (01) :48-56
[4]   Scheduling of parts and robot activities in a two machine robotic cell [J].
Aneja, YP ;
Kamoun, H .
COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (04) :297-312
[5]  
[Anonymous], ROBOTS MANUFACTURING
[6]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[7]   OPTIMAL PROGRAMMING OF WORKING CYCLES FOR INDUSTRIAL ROBOTS [J].
BEDINI, R ;
LISINI, GG ;
STERPOS, P .
JOURNAL OF MECHANICAL DESIGN-TRANSACTIONS OF THE ASME, 1979, 101 (02) :250-257
[8]  
Blazewicz J., 1991, International Journal of Flexible Manufacturing Systems, V4, P5, DOI 10.1007/BF01325094
[9]  
BLAZEWICZ J, 1989, P 3 ORSA TIMS C FLEX, P281
[10]   Complexity of one-cycle robotic flow-shops [J].
Brauner, N ;
Finke, G ;
Kubiak, W .
JOURNAL OF SCHEDULING, 2003, 6 (04) :355-371