Abstract: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… Show more
“…A one-wafer action sequence is defined as a sequence of robot actions which pick and place each module exactly once [2]. In [3], [4], analytical models of steady-state throughput are discussed for a cluster tool equipped with single-blade and double-blade robots.…”
Section: Process Modulementioning
confidence: 99%
“…For a double-blade robot, Venkatesh et al [4] propose one optimal schedule by a "swap" action. Dawande et al [2] summarize the sequencing and scheduling in robotic cells, which is similar to cluster tools. Geismar et al [5] extend the result in [6] and discuss the throughput and scheduling analysis of a robotic cell with a single-gripper robot and parallel stations.…”
Section: Process Modulementioning
confidence: 99%
“…We also call cluster C i a transfer cluster if (1) R i is a singleblade robot, (2) there is no process module in C i , and (3) both side buffer modules (or BPM) have one-wafer capacities. Due to the fact that there is not enough wafer storage space to flexibly move wafers, we will handle transfer clusters slightly different.…”
Section: Cluster Tool Configurations and Single-cluster Schedulinmentioning
Abstract-Modeling and scheduling of cluster tools are critical to improving the productivity and to enhancing the design of wafer processing flows and equipment for semiconductor manufacturing. In this paper, we extend the decomposition methods in [1] for multi-cluster tools with buffer/process modules (BPMs). The computation of the lower-bound cycle time (fundamental period) is presented. Optimality conditions and robot schedules that realize such lower-bound values are then provided using "pull" and "swap" strategies for single-blade and double-blade robots, respectively. The impact of BPMs on throughput and robot schedules is studied. It is found that such an impact depends on the BPM processing time and the cycle times of the decomposed clusters on both sides of BPMs. A chemical vapor deposition (CVD) tool is used as an example of multi-cluster tools to illustrate the proposed method, analysis, and algorithms. The numerical and experimental results demonstrate the effectiveness and efficiency of the algorithms.
“…A one-wafer action sequence is defined as a sequence of robot actions which pick and place each module exactly once [2]. In [3], [4], analytical models of steady-state throughput are discussed for a cluster tool equipped with single-blade and double-blade robots.…”
Section: Process Modulementioning
confidence: 99%
“…For a double-blade robot, Venkatesh et al [4] propose one optimal schedule by a "swap" action. Dawande et al [2] summarize the sequencing and scheduling in robotic cells, which is similar to cluster tools. Geismar et al [5] extend the result in [6] and discuss the throughput and scheduling analysis of a robotic cell with a single-gripper robot and parallel stations.…”
Section: Process Modulementioning
confidence: 99%
“…We also call cluster C i a transfer cluster if (1) R i is a singleblade robot, (2) there is no process module in C i , and (3) both side buffer modules (or BPM) have one-wafer capacities. Due to the fact that there is not enough wafer storage space to flexibly move wafers, we will handle transfer clusters slightly different.…”
Section: Cluster Tool Configurations and Single-cluster Schedulinmentioning
Abstract-Modeling and scheduling of cluster tools are critical to improving the productivity and to enhancing the design of wafer processing flows and equipment for semiconductor manufacturing. In this paper, we extend the decomposition methods in [1] for multi-cluster tools with buffer/process modules (BPMs). The computation of the lower-bound cycle time (fundamental period) is presented. Optimality conditions and robot schedules that realize such lower-bound values are then provided using "pull" and "swap" strategies for single-blade and double-blade robots, respectively. The impact of BPMs on throughput and robot schedules is studied. It is found that such an impact depends on the BPM processing time and the cycle times of the decomposed clusters on both sides of BPMs. A chemical vapor deposition (CVD) tool is used as an example of multi-cluster tools to illustrate the proposed method, analysis, and algorithms. The numerical and experimental results demonstrate the effectiveness and efficiency of the algorithms.
“…Multi-species batch production enterprises take the cellular manufacturing have become a development trend. In recent years, foreign studies more focused on physical and technical factors of equipment layout and production processes [1][2][3][4], as well as the production organizational forms and technical support based on multi-enterprise co-production [5,6]. China's theoretical according to the status and existing problems in Chinese manufacturing, had done many researches on the construction of production cells and network production systems, production scheduling in the cases of single enterprise and multi-enterprise cooperation [7,8].…”
International Engineering Consortium predicted that cellular manufacturing would become the main production model of manufacturing enterprises in the future. Based on elaborating the basic concepts, this paper proposes organizational forms, autonomous management models and coordination mechanism of cellular manufacturing, and takes expected return of two production cells as a coordination example, then gives coordination process and coordination strategy of cellular manufacturing, so as to expand production management theory and provide reference to cellular manufacturing enterprises.
“…There is an extensive literature on robotic cell scheduling problems with surveys including Crama et al (2000) and Dawande et al (2005). An n-unit cycle can be defined as a robot move cycle which produces exactly n units and ends up with the same state of the cell as the starting state.…”
This paper considers the scheduling problems arising in two-and three-machine manufacturing cells configured in a flowshop which repeatedly produces one type of product and where transportation of the parts between the machines is performed by a robot. The cycle time of the cell is affected by the robot move sequence as well as the processing times of the parts on the machines. For highly flexible CNC machines, the processing times can be changed by altering the machining conditions at the expense of increasing the manufacturing cost. As a result, we try to find the robot move sequence as well as the processing times of the parts on each machine that not only minimize the cycle time but, for the first time in robotic cell scheduling literature, also minimize the manufacturing cost. For each 1-unit cycle in two-and three-machine cells, we determine the efficient set of processing time vectors such that no other processing time vector gives both a smaller cycle time and a smaller cost value. We also compare these cycles with each other to determine the sufficient conditions under which each of the cycles dominates the rest. Finally, we show how different assumptions on cost structures affect the results.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.