A methodology for designing exible cellular manufacturing systems

Transcription

1 IIE Transactions (1997) 29, 599±610 A methodology for designing exible cellular manufacturing systems RONALD G. ASKIN 1, HASSAN M. SELIM 2 and ASOO J. VAKHARIA 3 1 Systems and Industrial Engineering Department, The University of Arizona, Tucson, AZ 85721, USA 2 Production Engineering Department, College of Engineering and Technology, Helwan, Cairo, Egypt 3 Department of Decision and Information Sciences, College of Business Administration, University of Florida, Gainesville, FL 32605, USA Received December 1994 and accepted October 1996 Cell formation in cellular manufacturing deals with the identi cation of machines that can be grouped to create manufacturing cells and the identi cation of part families to be processed within each cell. Dynamic and random variations in part demands can negatively impact cell performance by creating unstable machine utilizations. The purpose of this paper is to introduce and illustrate an interactive cell formation method that can be used to design ` exible' cells. Flexibility in this context refers to routing exibility (i.e., the ability for the cellular system to process parts within multiple cells) and demand exibility (i.e., the ability of the cell system to respond quickly to changes in part demand and part mix). Through an experimental analysis using multiple data sets, we also validate the procedure and provide guidelines for parameter settings depending upon the type of exibility of interest to the user. Finally, trade-o s and interdependences between alternative types of exibility in the context of cellular systems are illustrated. 1. Introduction Cellular manufacturing (CM), an application of group technology, entails the creation and operation of manufacturing cells. Each cell is dedicated to processing a speci c set of part families. A manufacturing cell typically consists of several functionally dissimilar machines, whereas a part family consists of a set of parts with similar processing requirements. One of the rst problems encountered in implementing CM is that of cell formation (CF). CF deals with the identi cation of the part family or families and associated machine groups that constitute each cell. Although the operational bene ts of CM have been well-documented in the literature [1], it has also been argued that the implementation of cells could lead to a decrease in manufacturing exibility [2]. The major di culty with cells stems from potentially unstable machine utilizations due to dynamic and random variations in part demands [3]. This has led to some confusion as to the appropriateness of CM by industry users. On the one hand, companies would like to achieve the operational e ciencies through implementing CM systems, but, on the other hand, companies do not want to lose the strategic bene ts of exible operations. Further, as pointed out by Craig, et al. [4], exibility is one of the critical dimensions of enhancing the competitiveness of organizations and hence the design of ` exible' cells is an important issue [5]. This paper proposes a CF method that incorporates several exibility criteria to guide the creation of ` exible' cells. This approach is unique in several aspects. First, the cell system design generated is a function of the user priorities in terms of exibility dimensions. This not only allows the user to incorporate preset user priorities but also allows the investigation of trade-o s between con- icting exibility criteria. Secondly, although there is some prior research that has incorporated alternative process plans when identifying cell con gurations (e.g, [6±11]), this is one of the rst methods that focuses on part-operation requirements in creating cells. Most of the cell formation research to date (e.g., [12±20]) assumes that parts are processed on speci c machine types and the assignment of operations to machines is determined a priori. However, to allow for exibility in operationmachine assignments, we explicitly incorporate this decision into our procedure. Thirdly, the method proposed in this research includes an explicit improvement stage where the user can attempt to modify the candidate design to increase alternative (or all) types of system exibility. The remainder of this paper is organized as follows. In Section 2 the relevant literature is reviewed and the exibility criteria of interest for CM are introduced. Section X Ó 1997 ``IIE''

2 600 Askin et al. describes the proposed CF procedure, and Section 4 presents an illustration of the methodology. Section 5 describes the experiment conducted to validate the proposed methodology and provides user guidelines for parameter settings depending on the exibility criteria. Finally, the implications and conclusions of the research are discussed in Section Relevant literature In recent years there has been a tremendous growth in the number of CF methods. The surge of interest in the area has been fueled not only by surveys that have shown the bene ts of CM systems [1] but also because there is substantial industry interest in implementing CM systems. Comprehensive reviews of CF can be found in [5, 21±24]. In the context of this paper, two papers on CF are the most relevant. Tilsley and Lewis [25] were the rst to propose a CF method where routing exibility was a primary consideration. They essentially propose a system of `cascade' cells that are created such that the more critical part families can be processed in more than one cell. Thus, machines required to process critical part families are allocated to more than one cell. Although the algorithmic details of the procedure are not provided, they do point out the importance of building in routing exibility when machines within cells are subject to breakdowns. Machine downtime in a cell could be handled by having multiple machines of the same type in a cell or by routing operations performed on one machine in a cell to other machines in the same cell; however, these factors are not considered in their procedure. Dahel and Smith [26] propose a procedure to create cells such that routing exibility and cell independence could be simultaneously considered. They essentially formulate the CF problem as a multi-objective mathematical model that simultaneously attempts to create independent cells (by minimizing intercellular materials ows) and exible cells (i.e., cells containing the largest variety of machine types). Their logic is that routing exibility of the system is maximized when we can create such exible cells. In terms of exibility dimesions, there has been a remarkable lack of interest in designing cells that can respond quickly to changes in the part demands (in terms of new part introduction and in terms of changes in volumes of current part). To address this issue, Vakharia, et al. [27] develop a framework and measures for di erent exibility types relevant in the context of CM systems. These types are: machine type exibility: the ability of the machines grouped into cells to process a large number of distinct operation types; routing exibility: the ability of the cell system to process parts completely in multiple cells (referred to as process exibility in [28]); part volume exibility: the ability of the cell system to deal with volume changes in the current part mix; and part mix exibility: the ability of the cell system to handle di erent product mixes with minimum disruption. Of these exibility types, routing, part volume, and part mix exibilities are determined by the cell system design generated, whereas machine type exibility is also a function of the technological constraints on the machines. Our primary objective in this paper is to consider all four types of exibility in developing a CF method. This procedure is described in the next section. 3. Flexible cell formation (FCF) method An overview of the proposed FCF method is shown in Fig. 1. Phase I identi es the most economical set of machine types to process the required operations of the entire part set based on machine costs, capabilities, and capacities. Phase II assigns individual part-operations to individual machines with an objective of providing an assignment that will lead to minimum material handling cost in nal system design. Balancing material handling costs, current processing requirements, and exibility to adapt to changes, Phase III forms candidate cells. The exibility of this cellular con guration is then evaluated Fig. 1. An overview of the exible cell formation (FCF) method.

3 Methodology for designing exible cellular systems 601 and improved in Phase IV on the basis of the current set of part types and demands. Each phase of the procedure allows user interaction in terms of parameter settings. Further, once the cell design (with a xed set of parameters) is generated, measures to evaluate the design in several dimensions are provided. On the basis of such an evaluation, the user has the option of either completely regenerating the system design (i.e., start again at Phase I) or simply changing parameter settings at some intermediate level to modify the cell system design generated. Details of each phase are described next; the notation used for the complete method is shown in Table Phase I: assign operations to machine types Given a machine type population with di erent processing capabilities (in terms of operation types), Phase I is concerned with assigning operation types to machine types. Each operation type represents a set of identical operations required by one or more parts. An operation type could be a generic process such as drilling, but would in most instances be more speci c. For example, drilling with a speci c tool and power requirement might be an operation type. Although Phase I would ordinarily be used to assign operation types, the methodology could also be used to assign individual operations. A comprehensive mathematical model for carrying out this assignment is as follows: subject to Minimize Z ˆ XM X M mˆ1 X J jˆ1 X J mˆ1 jˆ1 c m u mj x mj XM mˆ1 F m N m 1 x mj ˆ 1 8 j; 2 u mj x mj U m N m 8 m; 3 x mj 2f0;1g 8m 8j; 4 N m 0 and integer 8 m: 5 In this model, the objective function minimizes the total annual operating cost of the operation±machine assignments and the total annualized procurement cost of machines. The rst constraint ensures that each operation is assigned to a single machine type. The second constraint ensures that operation±machine type assignments are feasible at the system level by ensuring that we acquire adequate capacity. In this case u mj is the fraction of machine type m required, assuming that all parts requiring operation j will be processed on machine type m. Because demand for each part type is assumed to be known, then if batch sizes are also known, the time needed for the required number of setups of each part can be included in Table 1. Notation for the FCF method Indices: p Index for parts p ˆ 1;...;P m Index for machine types m ˆ 1;...;M j Index for operation types j ˆ 1;...;J j p Index for operations required by part p j p ˆ 1;...;O p k m Index for machines of type m available/required k m ˆ 1;...;K m Parameters: D p Demand (in batches per unit time) for part p P pj 1ifjO p ; 0 otherwise A m Availability of each machine of type m 0 A m 1 F m Annualized procurement cost of a machine of type m y mj 1 if machine type m can perform operation j; 0 otherwise c m Annual operating cost for machine type m t mj Run time for one unit of any part for operation j on machine type m s mj Setup time for a batch of any part for operation j on machine type m u mj Number of type m machines required for operation j (machines/time) Required user inputs: U m Maximum allowable utilization for a machine of type m (Phase I) a Weighting factor for similarity measure (Phase III) C Number of cells to be identi ed c ˆ 1;...;C (Phase III) V Maximum allowable variability in cell size (Phase III) I Type of improvement algorithm to be implemented (Phase IV) Decision Variables: N m Number of machines of type m available/required x mj 1 if operation type j is assigned to be performed on machine type m X km j p 1 if part-operation j p is performed on machine k m 1 if machine k m is allocated to cell c Z km c

4 602 Askin et al. u mj. U m 0 U m 1 is a user-speci ed parameter that indicates the amount of slack capacity that should be built into the system. The user parameter U m controls the volume exibility of a cell system design. By setting lower values of U m, we build more slack capacity into the system and hence, allow the system to handle part volume changes without disruption. Finally, the technological constraints on the decision variables x mj and N m are enforced in the last two sets of constraints. Note that if we do not require that a part operation always be performed on the same machine type, we can relax the integrality restrictions on the x mj. For a known set of N m values, this model reduces to the generalized assignment problem (GAP). In the context of our problem, we would know N m if we were recon guring an existing system into a cellular system. In contrast, when designing a completely new system, we propose that initial estimates of N m be obtained by linearizing the xed machine cost and then selecting the least expensive machine type for each operation. With this assignment, estimate the number of machines of each type by computing d P j u mjx mj =U m e. Once these estimates of N m have been obtained, we use the Martello and Toth [29] enumerative algorithm for obtaining good solutions to the GAP model. Note that the nal N m values are based on the operation±machine type assignments resulting from applying this algorithm. A branch and bound strategy can be added to search for a better solution if desired. The output of this stage is the x mj and N m (if required) decision variables Phase II: assign part-operations to speci c machines Given operation assignments to machine types, Phase II assigns each part-operation to a speci c machine of each type such that the similarity between part-operations assigned to a machine is maximized and the user-speci ed maximum machine usage U m is not exceeded. Knowledge of these operation to machine assignments is needed in Phase III to include minimization of material handling as a criterion in the machine grouping decision. The goal in Phase II is to limit the number of intermachine and intercell transfers that will result from the nal cellular system design. We accomplish this by assigning sets of operations to the same machine if they satisfy either of two criteria. First, if multiple operations from the same part type are assigned to the same machine type in Phase I, these operations are now assigned to the same machine. Secondly, operations from parts that have similar machine type sequences, and therefore should be in the same cell, are assigned to the same machine. The technical procedure for this assignment is described below. The complete Phase II problem is separable by machine type and we solve this problem independently for each machine type that requires more than one machine. As in [13] we use a graph partitioning model for selecting machine assignments. However, instead of creating duplicate nodes based on discrete approximations of processing time requirements for each part, we create a node for each operation and use actual time requirements. Thus, each node in the graph represents a speci c part-operation assigned to this machine type in Phase I. The arc weight between each pair of nodes is 1 if both part-operations are required by the same part type. However, if a pair (say i and j) of nodes (part-operations) correspond to di erent parts (say p i and p j, respectively), then the arc weight is de ned as: S ij ˆ max N pi p j =O pi ; N pi p j =O pj ; 6 where N pi p j is the number of common operation types for parts p i and p j. Thus, S ij measures the similarity between the processing requirements for the part types to which part-operations i and j belong. Accordingly, S ij represents the relative desirability for the two operations to be assigned to the same machine. Note that 0 S ij 1. In the second stage, an initial partition for this graph is obtained by using the following heuristic. A part-operation pair with the lowest similarity is identi ed and each part-operation is assigned to two separate machines. This process is repeated iteratively until each machine has been assigned one part-operation. Then we sequentially assign the remaining part-operations to machines so as to maximize the internal similarity of all part-operations assigned to the same machine subject to U m. In the third and nal stage, we improve on this initial partition of operations to machines by using a capacity-constrained variant of the Kernighan and Lin [30] graph partitioning procedure. The output of this phase is the speci cation of the X km j p decision variables Phase III: identify candidate manufacturing cells Phase III of the FCF method involves clustering individual machines to identify candidate manufacturing cells. The individual part-operations performed in each cell are a function of the individual machines assigned to that cell (Phase II speci es the assignment of part-operations to individual machines). Our objective is twofold. We wish to form cells that are comprehensive for the current parts so as to minimize intercell material ows, but also to ensure exibility to react to changes in processing requirements. The algorithm used to create the candidate manufacturing cells is similar to that of Phase II, except that we now consider partitioning the individual machine set into the number of desired cells. A major di erence is in the manner by which the arc weights between individual machines are computed. The arc weight or desirability index d n1;n2 between nodes n1 and n2 (each representing an individual machine of type m1 and m2, respectively) is de ned as a convex combination of two parts:

5 Methodology for designing exible cellular systems 603 d n1;n2 ˆ awn1;n2 s n1;n2 0d n1;n2 1; 7 where Wn1;n2 s n1;n2; W n2;n1 g; W n1;n2 ˆ proportion of machine n1workload associated with parts that also use machine n2 " P Jjˆ1 Wn1;n2 c ˆ y m1;j P J jˆ1 y m2;j P J jˆ1 y # m1;j y m2;j J " P J 1 P # Jj2ˆj1 1 f j1j2 X c j1ˆ1 P J 1 j1ˆ1 P J j2ˆj1 1 Xc j1j2 j1j2 f j1j2 ˆ proportion of current parts that require operations j1 and j2 Xj1j2 c ˆ max y m1;j1; y m2;j1 max ym1;j2 ; y m2;j2 max y m1;j1 y m1;j2 ; y m2;j1 y m2;j2 : is computed as the maximum proportion of machine n1 orn2's work that involves parts that also visit the other machine given the current part-operation assignments. Wn1;n2 c is a function of the combined processing capability of machine pair n1 (of type m1) and n2 (of type m2). The motivation for Wn1;n2 c rests in the desirability, in a dynamic environment, to create cells that have the ability to process future parts that exhibit minor technological modi cations or to handle minor changes in Wn1;n2 s part mix and volume. Wn1;n2 c is the product of two terms. The rst term is the proportion of part operations that can be performed by the combined set of machines n1 and n2. The second term in Wn1;n2 c takes a weighted average over those operation pairs that require both machines of the likelihood that an arbitrary future part will require both operations. Xj1j2 c takes on the value 1 only if neither machine type m1 nor m2 can perform both operation j1 and j2, but this pair of operations can be completed by the union of the two machines. The weights f j1j2 then indicate the probability that a future part will require this pair of operations. Together these indicate whether the synergism resulting from combining these two machines in the same cell is likely to be useful. The parameter a is de ned by the user. A high value of a indicates a user preference for designing cells based on the current part set and demand requirements. In contrast, by specifying a lower value of a, the user can instead opt to focus on the possible set of operations that could be performed by both machines n1 and n2 rather than the current set that have been assigned. If the rm has additional technological forecasting information beyond that contained in the current part set, this information can be easily entered into the decision process by modifying the f j1j2 parameters accordingly. Once the arc weights between all nodes have been de- ned, the user is required to specify the number of cells to be identi ed (i.e., C) and the variability to be permitted in cell sizes (i.e., V ). Cell size is assessed in terms of the number of machines. C controls the number of partitions that will be created, whereas V controls the allowable range of the number of machines placed within each partition (cell). In practice, C would be set by organizational parameters such as size of worker teams, span of supervisory authority, and group dynamics. Given a range of cell sizes, the procedure can be applied for feasible values of C and the resultant solutions compared. On the basis of these inputs, the procedure for initial partitioning and improvement described in Phase II is used to partition the set of nodes, each representing a machine, into machine groups (cells). The output of Phase III is the Z km c decision variables and indicate the assignment of individual machines to cells. The three user-de ned parameters control the exibility of cell system design in di erent ways. a allows the incorporation of machine-level exibility (in terms of possible operations that can be performed) during the cell design process. Thus, by varying a the user can investigate how responsive the current part-operation to machine assignments are in the context of the set of operations which can be performed by each machine. The number of cells (C) can be hypothesized to impact the exibility of the cell design. By setting a low value of C, the size of each cell in terms of machines will be larger. Hence, we can argue that there will be more routing exibility built into the system as machine variety in each cell is likely to increase. Regarding the variability in cell size parameter V, it can be hypothesized that by allowing cell sizes to be more variable, there is the likelihood that a `master' cell consisting of a large number of machine types will be identi ed and thus routing exibility will once again be higher. Likewise a few highly specialized cells can be formed for current highly similar part families when appropriate. Note that both cases (i.e., small C and high V ) will probably increase the machine type exibility of the cell system con guration. This is primarily the result of there being a single cell that will contain multiple machine types and hence new parts can be processed in such a cell Phase IV: improvement and evaluation In Phase IV of the method we rst attempt to improve upon the preliminary cellular con guration. Depending upon the user input, we can improve the routing exibility and/or the volume exibility of this preliminary system design. Given a cell system design (indicating the assignment of speci c machines to cells and also the assignment of individual part-operations to machines in each cell), the routing exibility for a part p in a cell c is computed as follows: RF cp ˆ YO p j pˆ1 R cjp ; 8

6 604 Askin et al. where R cjp ˆ 1 Y m:y mjp ˆ1 1 A m K mc and K mc is the number of machines of type m assigned to cell c. R cjp provides the proportion of time that cell c has at least one machine available that can perform operation j p. RF cp computes the proportion of time that cell c has a set of machines operational that are capable of completely processing part p. Note that if none of the machines in cell c can process an operation j p on part p, then RF cp = 0. De ne F cp ˆ 1ifRF cp > 0 and 0 otherwise. Then the routing exibility of a given cell system design associated with an individual part p F p is simply the total number of cells that have the capability to process the part completely and is computed as F p ˆ XC cˆ1 F cp 9 and the aggregate routing exibility of the system design is simply given by F ˆ PP pˆ1 F p. Given that this measure is in uenced by the number of cells identi ed and does not indicate the balance of alternative cells across part types, an alternative aggregate measure of routing exibility can be computed as the percentage of parts that can be routed through more than one cell for processing. Other possible alternatives include F 0 ˆ PP pˆ1 log F p; which assigns an in nite penalty for creating a system with one or more parts that do not have a comprehensive cell, or F 00 ˆ PP pˆ1 log 1 F p. To improve upon the routing exibility of a given cell system design, we attempt to reassign parts, individual machines and/or part-operations in that order (without changing the total number of machines in the complete system). The general procedure is as follows. Each part is considered for reassignment to another cell that contains all the necessary equipment to process the part provided that machine capacity is available in that cell. After we perform this individually for every part, machine reassignment is considered if it will result in an increase in the number of cells to process one or more part types. Finally, the reassignment of part-operations is performed for those part types that cannot be completely processed in one cell. The objective of such a reassignment is to check whether we can identify another cell to completely process each part. Another improvement algorithm available to the user at this Phase of the FCF method focuses on volume exibility of the system design. Given a cell system design, the volume exibility is computed as the maximum equal percentage (de ned as d ) increase in volume for all parts that can be handled without changing the system con- guration. The improvement in volume exibility is performed as follows. First we identify the bottleneck machine(s) in the system (i.e., the machine(s) that restrict the volume exibility of the current design). Next, we attempt to reroute some load from this machine to another machine in the same cell that can perform the same operation. If this is not possible, we attempt to reroute the workload to a machine of the same type (or a machine that can perform the same operation) in another cell. The procedure is repeated iteratively until no further rerouting of load is possible. Once the cell design has been improved upon, we evaluate it not only in terms of routing and volume exibility (as de ned earlier) but also in terms of mix exibility. The exibility of the cell system to respond to a change in part mix can be assessed depending upon the type of such change. A mix change occurs either when the relative volume requirements of the current part mix change, or when a new part with an associated operation set and volume requirement is introduced in the system. To assess the exibility of a cell system to the rst type of change (i.e., relative volume change), we compute the maximum percentage of demand for each current individual part (de ned as d p ) which can be accommodated within the current cellular con guration. Demand for part types other than p are held constant for this calculation. To assess the exibility of the cell system to respond to the introduction of a new part, we need to consider two aspects: (i) the amount of slack capacity in the cell system to completely process all the demand requirements for the new part, and (ii) whether there is a set of machines within any one cell with adequate slack capacity to completely process all the demand requirements for the new part. Obviously (ii) is preferred because the new part will be completely processed in a cell (leading to no increase in intercellular ows). However, if this is not possible, it may be possible to process the new part through multiple cells as long as adequate capacity is available in the system to do so. To assess these two aspects, we compute three measures. The rst measure is denoted by c 1 and is computed as the percentage of new parts that can be accommodated in the current con guration (even if these parts need to be processed in multiple cells). Hence, c 1 evaluates the availability of capacity in the aggregate cell system with reference to new parts. The second measure, c 2, is computed as the percentage of new parts that can be completely processed within an existing cell without regard to capacity constraints (i.e., there exists at least one primary cell to process the new part). Hence, this measure attempts to capture the part-mix exibility of the cell design by restricting the intercellular ows of materials. The nal measure c 3 integrates the rst two measures and is computed as the percentage of new parts that can be completely processed within a single existing cell by explicitly considering the availability of capacity in the cell. These measures will be illustrated in the next section.

7 Methodology for designing exible cellular systems Illustration Table 2. Machine type data Machine Procurement Operating Availability Type m cost F m cost c m A m Table 3. Part data Part p Demand D p Batch size Q p Operation j The hypothetical example used to illustrate the procedure is as follows. There are 10 di erent machine types in the system. The system produces 19 parts requiring 12 di erent operation types. For each machine type, the procurement and operating costs F m and c m and the availability of each machine A m are shown in Table 2. The part demand in batches per year D p, the batch size Q p and part processing requirements matrix are shown in Table 3. The run and setup times are shown in Table 4. For this example we assume that the operation characteristics are not part dependent. (The FCF method does not require this assumption because each part-operation is treated separately in Phase II, and optionally in Phase I as well, but it does reduce the amount of data we must include in the table.) Thus, regardless of which part-operation is performed on a machine type, run and setup times are identical. We assume that the shop in question operates 8 hours per day, 250 days a year. At Phase I, assume that U m, the maximum allowable utilization of any machine, is m. From Table 4 we can see that only operations 7, 9, and 10 can be processed on more than one machine type. We assume that the number of machines is not xed; thus each operation is assigned to the machine type with minimum relaxed cost u mj c m F m =U m. On the basis of the solution to Phase I, operation 7 is assigned to machine type 9; operation 9 to machine type 1; and operation 10 to machine type 10. The number of machines N m required of each type are (2,2,1,2,2,2,1,1,2,2). Phase II is concerned with assigning each part-operation to a machine. Note that on the basis of the N m requirements from Phase I, this is only relevant for machine types 1, 2, 4, 5, 6, 9, and 10. Based on these part-operation±machine assignments, in Phase III we generate a candidate cell design with a ˆ 1 (to emphasize current part-operation to machine assignments), C ˆ 4 (four-cell design) and V ˆ 0 (i.e., cell size variability is not considered). Finally, in Phase IV, an improvement of the Phase III cell design is performed. We search for improved solutions in terms of volume and routing exibility (in that order). The Phase III and IV part-opera- Table 4. Run and setup times Machine Run/ Operation j type m setup time * R S R 3.5 S R 4.5 S R S R S R 2.5 S 20 7 R S R 2.5 S R S R 2.5 S 10 * The run times R are in minutes per unit; the setup times S are in minutes per batch.

8 606 Askin et al. Table 5. Part-operation/machine-cell assignments Part Operation set Phase III Phase IV Mach. ass. Cell ass. Mach. ass. Cell ass. 1 (1,4,6,9,11) (8,4,9,1,2) (2,2,2,3,2) (8,4,9,4,2) (2,2,2,2,2) 2 (2,3,4,8) (7,1,4,5) (3,1,3,3) (7,1,4,5) (3,3,3,3) 3 (1,2,4,8) (8,7,4,5) (2,3,3,3) No change 4 (1,4,7,9,11) (8,4,9,1,2) (2,2,2,3,2) (8,4,9,4,2) (2,2,2,2,2) 5 (1,7,9,11) (8,9,1,2) (2,2,3,2) (8,9,4,2) (2,2,2,2) 6 (6,8,10,12) (9,5,10,6) (1,1,1,1) No change 7 (3,6,8,10,12) (1,9,5,10,6) (1,1,1,1,1) No change 8 (2,3,4,5,8,9) (7,1,4,3,5,1) (3,3,3,3,3,3) No change 9 (3,4,5,8,9) (1,4,3,5,1) (3,3,3,3,3) No change 10 (3,4,6,8,10,12) (1,4,9,5,10,6) (1,3,1,1,1,1) No change 11 (3,8,10,12) (1,5,10,6) (3,1,1,1) (1,5,10,6) (1,1,1,1) 12 (1,4,7,11,12) (8,4,9,2,6) (2,2,2,2,2) No change 13 (10,11,12) (10,2,6) (4,4,1) No change 14 (10,11) (10,2) (4,4) No change 15 (10,11) (10,2) (4,4) No change 16 (1,4,11,12) (8,4,2,6) (2,2,2,2) No change 17 (1,7,11,12) (8,9,2,6) (2,2,2,2) No change 18 (10,11) (10,2) (4,4) No change 19 (10,11) (10,2) (4,4) No change tion assignments to individual machines and the cells to which these machines are allocated are shown in Table 5. Table 6 shows the nal individual cell compositions (i.e., after Phase IV) in terms of machines and the average usage of each machine in each cell. Table 6. Cell compositions after Phase IV Cell Machine type assigned Number of machines Av. usage per machine * * This is computed as the average utilization per machine divided by the average availabilityof the machine of that type (i.e., A m ). The Phase III and IV assignments of individual partoperations to machines and the cells to which individual machines are allocated are shown in Table 5. For example, part 2 requires operations (2,3,4,8). At Phase III, these operations are assigned to machine types (7,1,4,5), respectively as shown in column 3; and individual machines to which the load for these part-operations is allocated are placed in cells (3,1,3,3), respectively. Thus, for this part, one operation is performed in cell 1 while the other three operations are performed in cell 3. After implementing Phase IV, the load on machine type 1 in cell 1 (for the second operation on part 2) was rerouted to another machine of the same type in cell 3 and thus part 2 is completely processed in cell 3. As can be seen from Table 5, the Phase IV improvement procedure was able to reroute exceptional operations of ve parts (nos 1, 2, 4, 5, and 11) such that all of them could be completely processed within a cell. However, parts 3, 10, and 13 are still processed in multiple cells. The cell compositions shown in Table 6 are the individual cell compositions after implementing Phase IV of the FCF method. Although cell size variability was set at 0%, cell 4 (two machines) is smaller than the remaining cells (each with ve machines). This is because, to split up the 17 machines into four cells, the maximum size of a cell is set to d 17=4 e ˆ 5. Phase IV of the procedure also focuses on evaluating the generated cell design. In terms of routing exibility of the current design, we can see that all part types except 3, 10, and 13 have all operations assigned to machines included in a single cell. Thus, there is at least one cell to completely process these part types. To assess volume exibility of the cellular system shown in Table 5 (Phase

9 Methodology for designing exible cellular systems 607 IV assignment) and Table 6, we increased the demand (in batches per year) for every part type by the same percentage until the utilization of one or more machines exceeded the availability (i.e., A m ; see Table 2). For this cell system, this occurred when the number of batches for all parts was increased beyond 145% of their current demand in Table 3. Hence, the volume exibility d is 45% for the given cell system. In this case, the critical machine was machine type 2 in cell 2. Regarding mix exibility, the maximum percentage change in volume for an individual part d p that can be handled by the current system (keeping all other part volumes xed) is shown in Table 7. Further, for each individual part, we identify the related bottleneck machine type. Thus, Table 7 shows that for part type 3, we can accommodate at most a 740% increase in batch volume before machine type 7 in cell 3 becomes overloaded. To assess the exibility of the system to respond to the introduction of new parts, we proceed as follows. First, we generate the demand (in batches) and batch size (in units) for a potential new part by using a discrete uniform distribution with parameters (4,11) and (100,961), respectively. Secondly, for the part, we randomly generate the number of operations required for processing by using a discrete uniform distribution with parameters (2,6). These parameter settings are chosen on the basis of the minimum and maximum demand, batch sizes and number of operations required for all parts shown in Table 3. Thirdly, we generate the individual operations required to process the part randomly from the current set of operations as follows. The probability p j that a particular operation is selected rst is based on the frequency f j that that operation is used for processing Table 7. Mix exibility of the cell design Part p Mix ex. (%) d p Critical mach , parts in the current mix and is computed as f j = P j f j. Once the rst operation has been selected, the second operation for the new part is selected conditioned on the rst. Thus, the probability that operation j1 is selected as the second operation given that operation j is the rst operation is computed as f 1 j1 = P j f 1 j. In this case f 1 j1 is de ned as the frequency that operation j1 appears along with operation j in the operation sequences for all parts. This sequential procedure is repeated until all the operations in the operation set for a new part have been generated. Using the procedure described, we assessed the exibility of the current system to respond to new part introduction. For the designed system, 68% of 40 randomly generated new parts could be processed in the current system if we allowed intercellular ows of batches (i.e., c 1 ˆ 68%); 48% of the new parts could possibly be processed within a single cell (without considering machine availability, i.e., c 2 ˆ 48%); and 40% of the new parts could be processed within a single cell (i.e., without intercellular materials ows and explicitly considering machine availability, i.e., c 3 ˆ 40%). This concludes our illustration of the FCF method. We now turn to a discussion of the experiment performed to validate the usefulness of the routing and volume exibility improvement algorithms (Phase IV of the method) and to provide guidelines as to how the parameter settings impact routing, volume and mix exibility. 5. Experimental analysis In order to evaluate the FCF method two experiments were performed. The rst experiment used a designed experiment to test the value of the various steps and parameter settings in the FCF method to obtain exible cell designs. The second experiment compared the FCF method to alternative methods for nding dense cells Evaluation of algorithmic steps and parameter settings For the rst experiment, the factors investigated and their treatment levels are: (1) maximum allowable machine usage U (set at Phase I): 85% and 100%; (2) parameter a (set at Phase III): 0, 0.5, 1; (3) number of cells C (set at Phase III): low, medium, high; (4) cell size variability V (set at Phase III): 0% and 20%; (5) improvement algorithm G (Phase IV): none (N), routing (R), volume (V), routing and volume (RV). To carry out the experimental analysis, we used eight data sets (seven published and the hypothetical data set used in Section 4). The seven data set sizes were:

10 608 Askin et al. P = 15, M = 10, J = 10 (see [31]); P = 19, M = 12, J = 12 (see [32]); P = 20, M =8,J= 8 (see [33]); P = 24, M = 14, J = 14 (see [34]); P = 43, M = 16, J = 16 (see [7]); P = 43, M = 14, J = 14 (see [7]); and P = 15, M = 95, J = 10 (see [16]). For each data set and factor/treatment level, we generated ve di erent cell designs by randomly varying the operation±machine type input data. (The procedure used is as follows. First, using a discrete uniform distribution, we generate the number of operations that can be performed by a machine type. The parameters for the distribution are data set dependent. Let this be equal to B m. Secondly, we randomly pick B m operations from the total number of possible operations (with an equal probability of picking any operation) and assume that any machine of type m can perform all these operations. Note that we always ensure that there is at least one machine type that can carry out each generic operation.) ANOVA was used to analyze the results. (Owing to space limitations, we do not present the ANOVA results in the paper. The interested reader is referred to [35].) A summary of the results reveals that: 1. Statistically signi cant increases in routing exibility were observed when the routing exibility improvement algorithm was implemented in Phase IV. Similarly, when the volume exibility improvement algorithm was implemented, statistically signi cant increases in volume exibility were noted. These results point to the usefulness of implementing the improvement algorithms in Phase IV of the FCF method. 2. To maximize routing exibility, the parameter a should be set to focus on current part-operation assignments, and fewer cells with highly variable cell sizes should be created. 3. To maximize volume and mix exibility (assessed by using c 3 ), larger slack capacity should be built into the system. Further, a larger number of cells is preferred for maximizing volume exibility, whereas more variable cell sizes are preferred for maximizing mix exibility. Summary recommendations for users of the FCF method based on these observations are shown in Table Comparison with other cell design approaches Co and Araar [16] proposed a procedure for assigning operations to machines and machines to cells for the case of duplicate machines. These steps correspond to Phases II and III of our method with the exception that those authors concentrated on designing cells for the current static part mix. They demonstrate their method on a 15-part, 63- machine problem. Their method produces a grouping ef- ciency [7] of 0.68 for this problem. Setting U ˆ 100%, Table 8. Experimentally determined preferred parameter settings a Factor/ user input Routing ex. (F) C ˆ 6 and a ˆ 1:0, and executing Phases II and III we obtained an improved grouping e ciency of Cell density was improved and the number of exceptional part operations was reduced, indicating improvement in both aspects of the e ciency measure. This was further improved in Phase IV to obtain an e ciency of By reassigning part operations, the FCF method was able to increase the comprehensiveness of the cell system. 6. Conclusions and implications Performance measure Volume ex. (d) Mix ex. (c 3 ) U ± LOW LOW a HIGH ± ± C LOW HIGH ± V HIGH ± HIGH G R RV RV a A ``±'' entry in the table indicates that the Factor/user input did not signi cantly impact the exibility measure. In this paper we have proposed a cell formation method that is unique in many respects. First, this method allows the user to design cellular systems that are exible (in terms of responsiveness to part demand and part mix changes as well as in terms of routing exibility). The method also allows the user to modify the preliminary cell design to increase the routing and/or part volume exibility. Secondly, the decision hierarchy provides a computationally feasible approach for solving problems of realistic size while including consideration of important factors such as alternate machine types and costs. Thirdly, the FCF method can generate multiple cellular con gurations depending upon user inputs. The user can trace out multiple solution alternatives by varying parameters on cell size, emphasis on current or future operations, and type of exibility preferred. Additionally, the user can modify individual phases to achieve desired objectives or test varying strategies. Fourthly, through an experimental analysis, we have also been able to provide guidelines on the use of the procedure. The method balances costs and exibility. Phase I minimizes xed machine cost plus direct processing costs. Phase II assigns operations to machines to take advantage of part similarities and operation exibility of machines. In turn, this serves to limit nal material handling costs due to intermachine and intercell transfers. Phase III groups machines by balancing actual material handling with system exibility. Finally, Phase IV can be used to increase exibility of the nal system design. The pro-

11 Methodology for designing exible cellular systems 609 posed methodology provides one approach for dealing with the complexity of the overall cellular manufacturing con guration problem. Although we have provided evidence that the individual phases of the procedure are computationally e cient (polynomially bounded heuristics) and highly competitive with previous procedures for each subproblem, we believe the major contribution lies in the integrated methodology for designing cells with consideration of exibility for a dynamic environment. Still, there is clearly potential for further research into exploring the cost± exibility tradeo. Acknowledgements This paper is based on work supported in part by the National Science Foundation under grant no. DDM References [1] WemmerloÈ v, U. and Hyer, N.L. (1989) Cellular manufacturing in the U.S. industry: a survey of users. International Journal of Production Research, 27(9), 1511±1530. [2] Vakharia, A.J. (1986) Cell formation in group technology: a framework for evaluation. Journal of Operations Management, 6(3), 257±272 (1986). [3] Morris, J.G. and Tersine, R.J. (1990) A simulation analysis of factors in uencing the attractiveness of group technology layouts. Management Science, 36(8), 1567±1578. [4] Craig, R.J., Moore, J.M. and Turner, W.C. (1975) Planned production exibility. Industrial Engineering, 7(1), 33±37. [5] Singh, N. (1993) Design of cellular manufacturing systems: an invited review. European Journal of Operational Research, 69(4), 284±291. [6] Askin, R.G. and Mitwasi, M.G. (1992) Integrating facility layout with process selection and capacity planning. European Journal of Operational Research, 27, 162±173. [7] Burbidge, J.L. (1975) The Introduction of Group Technology, Heinemann, London. [8] Kang, S.-L. and WemmerloÈ v, U. (1993) A work load oriented heuristic methodology for manufacturing cell formation allowing reallocation of operations. European Journal of Operational Research, 28(8), 292±311. [9] Rajamani, D., Singh, N. and Aneja, Y.P. (1990) Integrated design of cellular manufacturing systems in the presence of alternative process plans. International Journal of Production Research, 28(8), 1541±1554. [10] Sankaran, S. and Kasilingam, R.G. (1993) On cell size and machine requirements planning in group technology systems. European Journal of Operational Research, 69, 373±383. [11] Singh, N., and Sushil, K. (1990) Technology selection models for multi-stage production systems: joint application of physical system theory and mathematical programming. European Journal of Operational Research, 47, 248±261. [12] Al-Qattan, I. (1990) Designing exible manufacturing cells using branch and bound method. International Journal of Production Research, 28(2), 325±336. [13] Askin, R.G. and Chiu, K.S. (1990) A graph partitioning procedure for machine assignment and cell formation in group technology. International Journal of Production Research, 28(12), 1555±1572 [14] Askin, R.G. and Subramaniam, S.P. (1987) A cost-based heuristic for group technology con guration. International Journal of Production Research, 25(1), 101±113. [15] Choobineh, F. (1988) A framework for the design of cellular manufacturing systems. International Journal of Production Research, 26(8), 1161±1172 (1988). [16] Co, H.C. and Araar, A. (1988) Con guring cellular manufacturing systems. International Journal of Production Research, 26(12), 1511±1522. [17] Harhalakis, G., Nagi, R. and Proth, J.M. (1990) An e cient heuristic in manufacturing cell formation for group technology applications. International Journal of Production Research, 28(1), 185±198. [18] Irani, S.A., Cohen, P.H. and Cavalier, T.M. (1992) Design of cellular manufacturing systems. Transactions of the ASME, 114(2), 352±361. [19] Rajagopalan, R. and Batra, J. (1975) Design of cellular production systems ± a graph theoretic approach. International Journal of Production Research, 13(1), 56±68. [20] Vakharia, A.J. and WemmerloÈ v, U. (1990) Designing a cellular manufacturing system: a materials ow approach based on operation sequences. IIE Transactions, 22(1), 84±97. [21] Askin, R.G. and Vakharia, A.J. (1990) Group technology ± cell formation and operation. in The Automated Factory Handbook: Technology and Management, Cleland, D.I. and Bidanda, B. (eds), TAB Books, Blue Ridge Summit, PA. pp. 317±366. [22] Kusiak, A. (1987) The generalized group technology concept. International Journal of Production Research, 25(3), 561±569. [23] Selim, H.M., Askin, R.G. and Vakharia, A.J.( 1997) Cell formation in group technology: review, evaluation and directions for future research. International Journal of Computers & Industrial Engineering, to appear. [24] WemmerloÈ v, U. and Hyer, N.L. (1986) Procedures for the part family/machine group identi cation problem in cellular manufacturing. Journal of Operations Management, 6(3), 125±147. [25] Tilsley, R. and Lewis, F.A. (1977) Flexible cell production systems ± a realistic approach. Annals of the CIRP, 25, 269±271. [26] Dahel, N.E. and Smith, S.B. (1993) Designing exibility into cellular manufacturing systems. International Journal of Production Research, 31(6), 933±945. [27] Vakharia, A.J., Askin, R.G. and Selim, H.M. (1997) Flexibility considerations in cell design. in Handbook of Cellular Manufacturing, Irani, S.A. (ed.), John Wiley and Sons, New York, pp. to appear. [28] Sethi, A.K. and Sethi, S.P. (1990) Flexibility in manufacturing: a survey. International Journal of Flexible Manufacturing Systems, 2(3), 289±329. [29] Martello, S. and Toth, P. (1981) An algorithm for the generalized assignment problem, in Operational Research 81, Barnes, J.P. (ed.), North-Holland, Amsterdam, pp. 589±603. [30] Kernighan, B.W. and Lin, S. (1970) An e cient heuristic procedure for partitioning graphs. AT &T Bell Labs. Technical Journal, 49 (3), 291±307. [31] Chan, H.M. and Milner, D.A. (1982) Direct clustering algorithm for group formation in cellular manufacturing. Journal of Manufacturing Systems, 1(1), 65±74. [32] de Witte, J. (1980) The use of similarity coe cients in production ow analysis. International Journal of Production Research, 18(4), 503±514. [33] Chandrasekharan, M.P. and Rajagopalan, R. (1986) An ideal seed non-hierarchical clustering algorithm for cellular manufacturing. International Journal of Production Research, 24, 451±464. [34] Stanfel, L.E. (1985) Machine clustering for economic production Engineering Costs and Production Economics, 9, 73±81. [35] Selim, H.M. (1993) A exible cell formation approach for cellular manufacturing. Ph.D. Dissertation, College of Business and Public Administration, The University of Arizona, Tucson.