Abstract:Although the impact of layout on the productivity of manufacturing systems is well recognized, a quantification of this impact is an issue that is often ignored or crudely approximated in practice. When evaluating competing layouts for a manufacturing system, the trade-off between their relative benefits and their relative costs underlines the need for a reasonably accurate comparison of the productivity offered by these potential layouts. In this paper, we argue for this approach by comparing the productivity… Show more
“…1(a) travels from the output buffer O to machine M 1 by moving counterclockwise (passing I, time 2δ) because clockwise travel (traversing machines M 5 , M 4 , M 3 , and M 2 , time 5δ) would require more time. This flexibility in robot movements can significantly improve the productivity of a cell; however, the sequencing of operations becomes more challenging, even for single-gripper cells (Brumson, 2001;Rajapakshe et al, 2011). Furthermore, schedules that are optimal in linear cells are not necessarily optimal in circular cells (Geismar, Sethi, Sidney, and Sriskandarajah, 2005), so different techniques are required to find efficient robot sequences.…”
This article considers the problems of scheduling operations in single-gripper and dual-gripper bufferless robotic cells in which the arrangement of machines is circular. The cells are designed to produce identical parts under the free-pickup criterion with additive intermachine travel time. The objective is to find a cyclic sequence of robot moves that minimizes the long-run average time required to produce a part or, equivalently, that maximizes the throughput. Obtaining an efficient algorithm for an approximation to an optimal k-unit cyclic solution (over all k≥ 1) is the focus of this article.The proposed algorithms introduce a new class of schedules, which are refered to as epi-cyclic cycles. A polynomial algorithm with a 5/3-approximation to an optimal k-unit cycle over all cells is developed. The performed structural analysis for dual-gripper cells leads to a polynomial-time algorithm that provides at worst a 3/2-approximation for the practically relevant case in which the dual-gripper switch time is less than twice the intermachine robot movement time. A computational study demonstrates that the algorithm performs much better on average than this worst-case bound suggests. The performed theoretical studies are a stepping stone for researching the complexity status of the corresponding domain. They also provide theoretical as well as practical insights that are useful in maximizing productivity of any cell configuration with either type of robot.
“…1(a) travels from the output buffer O to machine M 1 by moving counterclockwise (passing I, time 2δ) because clockwise travel (traversing machines M 5 , M 4 , M 3 , and M 2 , time 5δ) would require more time. This flexibility in robot movements can significantly improve the productivity of a cell; however, the sequencing of operations becomes more challenging, even for single-gripper cells (Brumson, 2001;Rajapakshe et al, 2011). Furthermore, schedules that are optimal in linear cells are not necessarily optimal in circular cells (Geismar, Sethi, Sidney, and Sriskandarajah, 2005), so different techniques are required to find efficient robot sequences.…”
This article considers the problems of scheduling operations in single-gripper and dual-gripper bufferless robotic cells in which the arrangement of machines is circular. The cells are designed to produce identical parts under the free-pickup criterion with additive intermachine travel time. The objective is to find a cyclic sequence of robot moves that minimizes the long-run average time required to produce a part or, equivalently, that maximizes the throughput. Obtaining an efficient algorithm for an approximation to an optimal k-unit cyclic solution (over all k≥ 1) is the focus of this article.The proposed algorithms introduce a new class of schedules, which are refered to as epi-cyclic cycles. A polynomial algorithm with a 5/3-approximation to an optimal k-unit cycle over all cells is developed. The performed structural analysis for dual-gripper cells leads to a polynomial-time algorithm that provides at worst a 3/2-approximation for the practically relevant case in which the dual-gripper switch time is less than twice the intermachine robot movement time. A computational study demonstrates that the algorithm performs much better on average than this worst-case bound suggests. The performed theoretical studies are a stepping stone for researching the complexity status of the corresponding domain. They also provide theoretical as well as practical insights that are useful in maximizing productivity of any cell configuration with either type of robot.
“…The empirical design often seems to buy a lottery on the final cell productivity via its respective cost-benefit analysis. 9 Over the years, many previous studies trying to give a problem-solving answer have taken some steps forward in this area. Mata and Tubaileh discuss the workstation layout problem in manufacturing cell served by a single robot.…”
Automatic operation system with industrial robots has become more and more popular, especially with the urgent requirement from 3C (Communication, computer and consumer electronics) manufactory. A robot cell, which often involves one or more robots and accessory equipment, can be regarded as part of the larger theme of cellular manufacturing. The objective that most interests manufacturers is the investment return rate. It is largely determined by the productivity of robotic cell, and the leading time of robotic production system. Therefore, a fast and efficient method to design a robotic cell layout with the maximum throughput for a given task is undeniably a worthy research topic. This paper attempts to discuss the challenges and key technologies in the robotic cell layout optimal design. The proper selection of configuration for task, manual operation skill learning and translation, collaborative design tool-chain, optimization in cell layout and operation scheduling, optimal end-of-arm tooling design, and human-robot collaboration are included in this discussion with existing or on-going problem-solving key technologies.
“…In contrast, Akturk et al (2005) studied flexible cells using a linear cell layout. Rajapakshe et al (2011) showed that the problem RF 1;1 m• |free,A,cyclic-1|C t is NP-hard. Our current article analyzes circular cells with dual-arm robots by examining all possible sequences, calculating their respective throughputs under this travel time metric, and determining the specific circumstances under which each is optimal.…”
Section: Literature Reviewmentioning
confidence: 99%
“…This is common in the literature. Examples include Sethi et al (1992), Lei and Wang (1994), Crama and Van de Klundert (1997), Hall et al (1997), Levner et al (1997), Venkatesh et al (1997), Agnetis (2000), Herrmann et al (2000), Brauner and Finke (2001), Che et al (2003), , Akturk et al (2005), Kumar et al (2005), Dawande et al (2010), and Rajapakshe et al (2011). Thus, any part in the cell is always either on one of the machines or being handled by one of the two robot arms.…”
This article assesses the benefits of implementing a dual-arm robot in a flow shop manufacturing cell. Such a robot has the ability to tend (unload or load) to two adjacent machines simultaneously. This significantly changes the analysis required to find sequences of robot actions that maximize a cell's throughput. For cells processing identical parts, optimal sequences are identified for two-and three-machine cells and also structural results are derived for cells with an arbitrary number of machines. Cells processing different part-types are fully analyzed for the case of two-machine cells. For each case the productivity of single-arm and dual-arm robotic cells is compared.
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.