TL;DR: In this paper, a tool management problem for flexible machines is discussed, where the problem is to decide how to sequence the parts to be produced, and what tools to allocate to the machine, in order to minimize the number of tool setups.
Abstract: A central problem of tool management for flexible machines is to decide how to sequence the parts to be produced, and what tools to allocate to the machine, in order to minimize the number of tool setups. The problem becomes especially crucial when the time needed to change a tool is significant with respect to the processing times of the parts, or when many small batches of different parts must be processed in succession. These phenomena have been observed in the metal-working industry by Hirabayashi, Suzuki and Tsuchiya (1984), Finke and Kusiak (1987), Bard (1988), Tang and Denardo (1988a), Bard and Feo (1989), etc. Blazewicz, Finke, Haupt and Schmidt (1988) describe for instance an NC-forging machine equipped with two tool magazines, each of which can handle eight tools. The tools are very heavy, and exchanging them requires a sizeable fraction of the actual forging time. Another situation where minimizing the number of tool setups may be important is described by Forster and Hirt (1989, p. 109). These authors mention that, when the tool transportation system is used by several machines, there is a distinct possibility that this system becomes overloaded. Then, minimizing the number of tool setups can be viewed as a way to reduce the strain on the tool transportation system. Bard (1988) mentions yet another occurrence of the same problem in the electronics industry. Suppose several types of printed circuit boards (PCBs) are produced by an automated placement machine (or a line of such machines).
TL;DR: The syntax and principles for constructing consistent and valid safety-barrier diagrams are described and the latter's relation to other methods such as fault trees and Bayesian Networks is discussed.
TL;DR: The numerical and experimental results demonstrate that the proposed decomposition approach provides a powerful method to analyze the throughput and robot schedules of multicluster tools.
Abstract: Cluster tools are widely used as semiconductor manufacturing equipment. While throughput analysis and scheduling of single-cluster tools have been well-studied, research work on multicluster tools is still at an early stage. In this paper, we analyze steady-state throughput and scheduling of multicluster tools. We consider the case where all wafers follow the same visit flow within a multicluster tool. We propose a decomposition method that reduces a multicluster tool problem to multiple independent single-cluster tool problems. We then apply the existing and extended results of throughput and scheduling analysis for each single-cluster tool. Computation of lower-bound cycle time (fundamental period) is presented. Optimality conditions and robot schedules that realize such lower-bound values are then provided using ldquopullrdquo and ldquoswaprdquo strategies for single-blade and double-blade robots, respectively. For an -cluster tool, we present lower-bound cycle time computation and robot scheduling algorithms. The impact of buffer/process modules on throughput and robot schedules is also studied. A chemical vapor deposition tool is used as an example of multicluster tools to illustrate the decomposition method and algorithms. The numerical and experimental results demonstrate that the proposed decomposition approach provides a powerful method to analyze the throughput and robot schedules of multicluster tools.
TL;DR: In this paper, the authors present a tool set robust to changes in demand that considers a set of possible, discrete demand scenarios with associated probabilities, and determines the tools to purchase, under a budget constraint, to minimize weighted average unmet demand.
Abstract: In the semiconductor industry, capacity planning, the calculation of number of tools needed to manufacture forecasted product demands, is difficult because of sensitivity to product mix and uncertainty in future demand. Planning for a single demand profile can result in a large gap between planned capacity and actual capability when the realized product mix turns out differently from the one planned. This paper presents a method which accepts this uncertainty and uses stochastic integer programming to find a tool set robust to changes in demand. It considers a set of possible, discrete demand scenarios with associated probabilities, and determines the tools to purchase, under a budget constraint, to minimize weighted average unmet demand. The resulting robust tool set deals well with all the scenarios at no or minimal additional cost compared to that for a single demand profile. We also discuss the modifications of conventional business processes, needed to implement this method for dealing explicitly with uncertainty in demand.
TL;DR: This paper proposes a solution using ubiquitous computing technologies that improves aircraft maintence and provides a high level of usability and a scenario, a systems architecture, and maintenance applications are presented.
Abstract: Ubiquitous Computing bears a high potential in the area of aircraft maintenance. Extensive requirements regarding quality, safety, and documentation as well as high costs for having aircrafts idle during maintenance demand for an efficient execution of the process. Major weaknesses that impact the efficiency of the process are an inadequate tool management, human erros, and labour intensive manual documentation and check procedures. In this paper we propose a solution using ubiquitous computing technologies that improves aircraft maintence and provides a high level of usability. A scenario, a systems architecture, and maintenance applications are presented. The Smart Toolbox and the Smart Tool Inventory were implemented as proof of concept.