A simulation analysis of factors influencing the flexibility of cellular manufacturing

The performance of cellular manufacturing (CM) systems in a variable demand and flexible workforce environment has been examined using simulation modelling. Discrepancies between academicians and practitioners’ findings with respect to flexibility and uneven machine utilization in CM systems are discussed. The views of two parties were incorporated in simulation models to rectify the existing discrepancies. While the results of this study confirm the previous findings of academicians regarding the deterioration of the performance of CM in a variable product mix situation, it appears that those results may be significantly influenced by considering a flexible workforce. The simulation results show that the practice of using flexible crossed-trained operators can improve the flexibility of CM in dealing with an unstable demand and can reduce load imbalance inherent in machine dedication in manufacturing cells.     

A real options model of phased migration to cellular manufacturing

The literature is replete with models that examine various aspects of cellular manufacturing (CM), such as optimisation of cell layouts. However, many firms may realise zero to marginal returns from CM. Given this uncertainty, the manager should first determine the value of CM to the firm before deploying it. Although traditional valuation models employing discounted cash flow analysis allow for uncertainty, they treat future investments as fixed when computing the investment’s present value. The real options (RO) logic of valuation allows the manager to exercise the option to invest in or abandon a project based on expected outcomes. Future investments are thus options. This paper presents an RO model for CM migration that addresses whether a firm should migrate to CM; and it prescribes the sequence of cell deployment, which has not been addressed in the literature. Our model is also much more transparent and accessible to practitioners, with an accompanying software tool for prospective users. Finally, we use simulation extensively to discover the drivers of the optimal cell deployment sequence. Our results show that there is a complex interplay between net present value, speed of cellularisation, inter-cell learning and volatility in terms of their influence on the cell sequence.     

A simulation comparison of group technology with traditional job shop manufacturing

A simulation model of an actual job shop was used to compare group technology with traditional job shop manufacturing. The experiment compared shops which had four different layouts, designed to emphasize different features of traditional job shops and group technology shops, and four distributions of demand for end items. The group technology shops exhibited superior performance in terms of average move time and average set-up time. The traditional job shops had superior performance in queue related variables (average queue length, average waiting time, work-in-process inventory, etc.). This was caused by group technology's dedication of machines. The effects of the queue related variables outweighed the effects of average move time and average set-up time: the average flow time was shorter in the traditional job shop than in the group technology shops.     

Performance comparison of virtual cellular manufacturing with functional and cellular layouts in DRC settings

This study investigates the performance of virtual cellular manufacturing (VCM) systems, comparing them with functional layouts (FL) and traditional, physical cellular layout (CL), in a dual-resource-constrained (DRC) system context. VCM systems employ logical cells, retaining the process layouts of job shops. Part family-based scheduling rules are applied to exploit the benefits of group technology while retaining the flexibility and functional synergies of the job shop. Past studies of VCM have been based entirely on single-resource-constrained (SRC) systems, i.e. as purely machine-limited systems, assuming that resources such as labour and tooling do not restrict the output. However, given the fact that labour forms a second major constraining resource, and many of the advantages associated with cellular manufacturing are derived from labour flexibility, it becomes necessary to extend the research to DRC systems. In this study, we assume several levels of labour flexibility in all three systems, in addition to other relevant factors such as lot size, set-up reduction, and labour assignment rules. It is shown that VCM can outperform efficiently operated FL and CL in certain parameter ranges, as preliminary research has shown so far. However, it is shown that CL tends to outperform both VCM and FL in the parameter ranges customarily advocated for CL, namely, low lot sizes, adequate levels of set-up reduction, cross training of workers, and worker mobility within cells.     

Integrated scheduling and self-reconfiguration for assembly job shop in knowledgeable manufacturing

The problems of integrated assembly job shop (AJS) scheduling and self-reconfiguration in knowledgeable manufacturing are studied with the objective of minimising the weighted sum of completion cost of products, the earliness penalty of operations and the training cost of workers. In AJS, each workstation consists of a certain number of teams of workers. A product is assumed to have a tree structure consisting of components and subassemblies. The assembly of components, subassemblies and final products are optimised with the capacity of workstations simultaneously. A heuristic algorithm is developed to solve the problem. Dominance relations of operations are derived and applied in the development of the heuristic. A backward insertion search strategy is designed to locally optimise the operation sequence. Once the optimal schedule is acquired, the teams are reconfigured by transferring them from workstations of lower utilisation to those of higher utilisation. Effectiveness of the proposed algorithm is tested by a number of numerical experiments. The results show that the proposed algorithm promises lower total cost and desirable simultaneous self-reconfiguration in accordance with scheduling.     

A possibilistic approach for designing hybrid cellular manufacturing systems

In this paper, a hybrid cellular manufacturing (HCM) system is presented in which the main sources of uncertainty, e.g. the demands of parts and unit costs are treated as fuzzy numbers in the form of possibilistic distributions. The basic concept of HCM is that high variation in demand might disturb cell efficiency, so forming cells with only those parts that have stable demand, will profit. Thus, to design stable and robust manufacturing cells, a two-phase method is proposed in which a fuzzy adaptive ranking method is first applied to identify those parts with low and non-repetitive demands (i.e. the special parts) which will then be assigned to a functional cell. Afterwards, an interactive possibilistic programming model is applied to cell formation of remaining regular parts while considering both part sequences and multiple routes. To show the capability and usefulness of the proposed method, an illustrative example is also provided. Finally, concluding remarks are reported.     

Simulation study of coordinating layout change and quality improvement for adapting job shop manufacturing to CONWIP control

Constant work-in-process (CONWIP) has been highlighted for its superiority over kanban for application in job shop environments. Smooth operation of CONWIP yet depends on some critical practices, including: layout change (from functional to cellular), quality improvement (QI) and set-up time reduction induced by layout change (STR). Simulation modelling was employed in this study to investigate the coordination of these conditions. QI was experimented with the mean magnitude and probability of occurrence for step shifts (MMSS and POSS, respectively); it has major effects on flow time variability only. If STR is below 60%, a functional layout with push control was found favourable while QI is not effective. STR needs to reach 60% to justify layout change; POSS and MMSS reductions are effective for cellular layouts with CONWIP and push control, respectively. At this stage, promotion of improvement activities should be the major concern for replacing push control with CONWIP. The performance of CONWIP is superior if a 70% or larger STR is achieved. In this case, it enables greater delivery performance upgrade via strengthening the effectiveness of QI in reducing flow time variability. Essential guidelines were ultimately derived for reforming traditional job shop practices, progressing through layout change, towards the realisation of CONWIP.     

A similarity score-based two-phase heuristic approach to solve the dynamic cellular facility layout for manufacturing systems

The dynamic cellular facility layout problem (DCFLP) is a well-known NP-hard problem. It has been estimated that the efficient design of DCFLP reduces the manufacturing cost of products by maintaining the minimum material flow among all machines in all cells, as the material flow contributes around 10–30% of the total product cost. However, being NP hard, solving the DCFLP optimally is very difficult in reasonable time. Therefore, this article proposes a novel similarity score-based two-phase heuristic approach to solve the DCFLP optimally considering multiple products in multiple times to be manufactured in the manufacturing layout. In the first phase of the proposed heuristic, a machine–cell cluster is created based on similarity scores between machines. This is provided as an input to the second phase to minimize inter/intracell material handling costs and rearrangement costs over the entire planning period. The solution methodology of the proposed approach is demonstrated. To show the efficiency of the two-phase heuristic approach, 21 instances are generated and solved using the optimization software package LINGO. The results show that the proposed approach can optimally solve the DCFLP in reasonable time.     

A genetic scheduling methodology for virtual cellular manufacturing systems: an industrial application

Effective solutions to the cell formation and the production scheduling problems are vital in the design of virtual cellular manufacturing systems (VCMSs). This paper presents a new mathematical model and a scheduling algorithm based on the techniques of genetic algorithms for solving such problems. The objectives are: (1) to minimize the total materials and components travelling distance incurred in manufacturing the products, and (2) to minimize the sum of the tardiness of all products. The proposed algorithm differs from the canonical genetic algorithms in that the populations of candidate solutions consist of individuals of different age groups, and that each individual's birth and survival rates are governed by predefined aging patterns. The condition governing the birth and survival rates is developed to ensure a stable search process. In addition, Markov Chain analysis is used to investigate the convergence properties of the genetic search process theoretically. The results obtained indicate that if the individual representing the best candidate solution obtained is maintained throughout the search process, the genetic search process converges to the global optimal solution exponentially.

The proposed methodology is applied to design the manufacturing system of a company in China producing component parts for internal combustion engines. The performance of the proposed age-based genetic algorithm is compared with that of the conventional genetic algorithm based on this industrial case. The results show that the methodology proposed in this paper provides a simple, effective and efficient method for solving the manufacturing cell formation and production scheduling problems for VCMSs.     

Comparative study of push and pull systems considering quality performance in a cell-based job shop environment

Simulation experiments were used to investigate the influences of quality performance on the performance difference between push and pull systems in a cell-based job shop environment. Quality performance was represented by two factors, i.e. mean magnitude of step shifts (MMSS) and mean frequency of step shifts (MFSS). Shop performance was based on the average and standard deviation of flow time. Results show that push systems are superior to pull systems, regardless of quality performance and set-up time reduction (STR) effected by cellular manufacturing. Therefore, to justify the adoption of pull systems, their potentials beyond material flow control (e.g. in promoting continuous improvement) need to be realized. In addition, the larger the STR, the more effective the quality performance improvement. With a large STR (of 80%), reduction of MMSS or (and) MFSS can improve the average (standard deviation) of flow time. In particular, reduction of MFSS tends to be more effective for a pull system with a larger STR. Accordingly, for a pull system in a cell-based job shop environment, substantial set-up time reduction is critical not only for efficient process operations, but also for effective quality performance improvement.     

Designing integrated cellular manufacturing systems with tactical decisions

In this paper, we aim to design cellular manufacturing systems that optimize the performance of a manufacturing system subject to the optimization aspects of production planning. Consequently, the demand for each part – one of the production planning features – plays a vital role in determining the part families and the formation of machine cells in each period. In our study, holding and backorder costs follow a probabilistic structure, and they are described by a set of stochastic scenarios. In this model, five objective functions are employed: one of them minimizes the expected total holding and backorder costs in order to evaluate the risk in the model. The aim of this model is to select and optimize the assignment of parts and machines to different cells as well as the number of each produced part in each period. A new heuristic algorithm based on the optimization method is established to yield the best solution for this complicated mathematical formulation. Further, the performance of the proposed algorithm is verified using certain test problems in which the obtained results are compared with those obtained using the branch-and-bound algorithm and heuristic procedures.     

Design of cellular manufacturing system with quasi-dynamic dual resource using multi-objective GA

A new concept is presented in this paper of quasi-dynamic cell formation for the design of a cellular manufacturing system, based on analysing the fact that static and dynamic cell formation could not reflect the real situation of a modern cellular manufacturing system. Further, workforce resources are integrated into quasi-dynamic cell formation and thus a quasi-dynamic dual-resource cell-formation problem is proposed. For solving this problem, this paper first establishes a non-linear mixed integer programming model, where inter-cell and intra-cell material cost, machine relocation cost, worker operation time, loss in batch quality and worker salary are to be minimised. Then, a multi-objective GA is developed to solve this model. Finally, a real life case study is conducted to validate the proposed model and algorithm. The actual operation results show that the case enterprise significantly decreases its material handling cost and workforce number and obviously increases its product quality after carrying out the obtained scheme.     

Agent-based dynamic part family formation for cellular manufacturing applications

One of the main critique on cellular manufacturing and its algorithms is their inability to handle dynamics events, especially dynamic changes in part spectrum. Unfortunately, there are not many efforts in the literature to overcome this problem. Agent oriented computing provides a marvellous opportunity to handle dynamic problems and to provide effective solutions, if carefully and intelligently implemented. In this paper, we have proposed a novel agent-based clustering algorithm for part family formation in cellular manufacturing by considering dynamic demand changes. However, it is not easy to directly compare the performance of the proposed algorithm with the literature results as there is no benchmark for dynamic cell formation problems. We attempt to compare the performance of the present algorithm on static test problems by dynamically introducing parts in these data-sets to our algorithm. Many results have been presented on these static data-sets by utilising several heuristics, meta-heuristics and optimisation-based algorithms. Although the proposed algorithm is not an optimisation-based algorithm and its operation is directed to handle dynamic changes in the problem domain through negotiation, we have shown that it has ability to provide very good results which are comparable to the best known solutions.     

Effective two-phase p-median approach for the balanced cell formation in the design of cellular manufacturing system

In this paper, we present an effective two-phase p-median approach for the balanced cell formation (CF) in the design of cellular manufacturing system. In phase 1, the p-median mathematical model of machine CF, which adopts a linear integer programming formulation, is developed. Our formulation uses a new similarity coefficient based on the generalised nonbinary part-machine incidence matrix (PMIM) which incorporates realistic manufacturing aspects such as setup time, processing time, operation sequences and lot size of parts and duplicate machine types. In phase 2, a systematic part assignment procedure based on the new classification scheme of part types is established in pursuit of balancing the workload among machine cells. New efficiency measures for evaluating the quality of the binary and nonbinary PMIM-based block diagonal solutions are proposed to judge the degree of cell load imbalance. Computational experiments with moderately intermediate-sized data-sets selected from the literature show effectiveness of our two-phase p-median approach for the balanced CF.     

A scatter search approach to sequence-dependent setup times job shop scheduling

Scheduling jobs on multiple machines is a difficult problem when real-world constraints such as the sequence setup time, setup times for jobs and multiple criteria are used for solution goodness. It is usually sufficient to obtain a near-optimal solution quickly when an optimal solution would require days or weeks of computation. Common scheduling heuristics such as Shortest Processing Time can be used to obtain a feasible schedule quickly, but are not designed for multiple simultaneous objectives. We use a new meta-heuristic known as a scatter search (SS) to solve these types of job shop scheduling problems. The results are compared with solutions obtained by common heuristics, a tabu search, simulated annealing, and a genetic algorithm. We show that by combining the mechanism of diversification and intensification, SS produces excellent results in a very reasonable computation time. The study presents an efficient alternative for companies with a complicated scheduling and production situation.     

Workload based order acceptance in job shop environments

In practice, order acceptance and production planning are often functionally separated. As a result, order acceptance decisions are made without considering the actual workload in the production system, or by only regarding the aggregate workload. We investigate the importance of a good workload based order acceptance method in over-demanded job shop environments, and study approaches that integrate order acceptance and resource capacity loading. We present sophisticated methods that consider technological restrictions, such as precedence relations, and release and due dates of orders. We use a simulation model of a generic job shop to compare these methods with straightforward methods, which consider capacity restrictions at an aggregate level and ignore precedence relations. We compare the performance of the approaches based on criteria such as capacity utilisation. The simulation results show that the sophisticated approaches significantly outperform the straightforward approaches in case of tight due dates (little slack). In that case, improvements of up to 30% in utilisation rate can be achieved. In case of much slack, a sophisticated order acceptance method is less important.This complete issue was revised and published online in November 2004. The previous version contained a false date. Correspondence to: E.W. Hans     

Multi-objective cell formation and production planning in dynamic virtual cellular manufacturing systems

This article presents a fuzzy goal programming-based approach for solving a multi-objective mathematical model of cell formation problem and production planning in a dynamic virtual cellular manufacturing system. In a dynamic environment, the product mix and part demand change over a planning horizon decomposed into several time periods. Thus, the cell formation done for one period may be no longer efficient for subsequent periods and hence reconfiguration of cells is required. Due to the variation of demand and necessity of reconfiguration of cells, the virtual cellular manufacturing (VCM) concept has been proposed by researchers to utilise the benefits of cellular manufacturing without reconfiguration charges. In a VCM system, machines, parts and workers are temporarily grouped for one period during which machines and workers of a group dedicatedly serve the parts of that group. The only difference of VCM with a real CM is that machines of the same group are not necessarily brought to a physical proximity in VCM. The virtual cells are created periodically depending on changes in demand volumes and mix, as new parts accumulate during a planning horizon. The major advantage of the proposed model is the consideration of demand and part mix variation over a multi-period planning horizon with worker flexibility. The aim is to minimise holding cost, backorder cost and exceptional elements in a cubic space of machine–part–worker incidence matrix. To illustrate the applicability of the proposed model, an example has been solved and computational results are presented.     

Fatigue behavior of Ti-6Al-4V cellular structures fabricated by additive manufacturing technique

Porous titanium and its alloys have been considered as promising replacement for dense implants, as they possess low elastic modulus comparable to that of compact human bones and are capable of providing space for in-growth of bony tissues to achieve a better fixation. Recently, the additive manufacturing (AM) method has been successfully applied to the fabrication of Ti-6Al-4V cellular meshes and foams. Comparing to traditional fabrication methods, the AM method offers advantages of accurate control of complex cell shapes and internal pore architectures, thus attracting extensive attention. Considering the long-term safety in the human body, the metallic cellular structures should possess high fatigue strength. In this paper, the recent progress on the fatigue properties of Ti-6Al-4V cellular structures fabricated by the AM technique is reviewed. The various design factors including cell shapes, surface properties, post treatments and graded porosity distribution affecting the fatigue properties of additive manufactured Ti-6Al-4V cellular structures were introduced and future development trends were also discussed.     

Integrated approach to part scheduling and inspection policies for a job shop manufacturing system

The quality of a product greatly depends on the quality of its components. This requires that manufacturing specifications have to be met in the manufacturing environment and as a consequence inspection stations are present in many manufacturing systems and inspection policies must be adopted. One problem, which has been widely investigated, concerns the detection of the inspection points in the hypothesis that the action to be taken is known when a defective part is detected. If different jobs are to be produced, then operation scheduling becomes yet another complex problem needing to be solved. And while the problem of scheduling has received a great amount of attention from researchers, to our knowledge the interaction between the two problems has not been treated in job-shop environment. In the present paper three different control policies are preliminarily examined: they differ both in terms of the number of operations that are inspected, and with regard to the type of intervention carried out on detection of a defect. Each control policy affects the optimal inspection locations, which, in their turn, influence operation scheduling. As will be shown in the present paper, a sequential decision process based on separate optimization steps can lead to very poor final results. For this reason, an integrated approach is proposed, in an attempt to identify an optimal solution using a genetic algorithm.     

Joint cell loading and scheduling approach to cellular manufacturing systems

A hierarchical multi-objective heuristic algorithm and pricing mechanism are developed to first determine the cell loading decisions, and then lot sizes for each item and to obtain a sequence of items comprising the group technology families to be processed at each manufacturing cell that minimise the setup, inventory holding, overtime and tardiness costs simultaneously. The linkage between the different levels is achieved using the proposed pricing mechanism through a set of dual variables associated with the resource and inventory balance constraints, and the feasibility status feedback information is passed between the levels to ensure internally consistent decisions. The computational results indicate that the proposed algorithm is very efficient in finding a compromise solution for a set of randomly generated problems compared with a set of competing algorithms.