Identical part production in cyclic robotic cells: Concepts, overview and open questions

被引:51
作者
Brauner, Nadia [1 ]
机构
[1] UJF, G SCOP, F-38031 Grenoble, France
关键词
scheduling; flow-shop; material handling system; cyclic production;
D O I
10.1016/j.dam.2008.03.021
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Robotic cells consist of a flow-shop with a robot for material handling. A single part is to be produced cyclically and the objective is to minimize production rate. This document introduces basic concepts and tools for dealing with cyclic production. In particular, it concentrates on k-cycies which are production cycles where exactly k parts enter and leave the cell. One defines the cycle function X which is the smallest Value of k so that the set of all k-cycles up to size X contains an optimal cycle for all instances. Known results and conjectures on these functions are given for the classical case where parts can remain oil the machine waiting for the robot and for the no-wait case where parts have to be removed from the machine as soon as their processing is finished. (c) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:2480 / 2492
页数:13
相关论文
共 43 条
[2]  
Ahuja RK, 1993, NETWORK FLOWS THEORY
[3]   Robotic cell scheduling with operational flexibility [J].
Akturk, MS ;
Gultekin, H ;
Karasan, OE .
DISCRETE APPLIED MATHEMATICS, 2005, 145 (03) :334-348
[4]  
[Anonymous], ROBOTS MANUFACTURING
[5]  
[Anonymous], P IEPM 01 INT C IND
[6]  
Bloch C., 1999, THESIS U FRANCHE COM
[7]   A framework for the complexity of high-multiplicity scheduling problems [J].
Brauner, N ;
Crama, Y ;
Grigoriev, A ;
Van de Klundert, J .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2005, 9 (03) :313-323
[8]   Complexity of one-cycle robotic flow-shops [J].
Brauner, N ;
Finke, G ;
Kubiak, W .
JOURNAL OF SCHEDULING, 2003, 6 (04) :355-371
[9]  
Brauner N, 1999, INFOR, V37, P20
[10]   Cycles and permutations in robotic cells [J].
Brauner, N ;
Finke, G .
MATHEMATICAL AND COMPUTER MODELLING, 2001, 34 (5-6) :565-591