Production Capacity of Flexible Manufacturing Systems with Fixed Production Ratios

Determining the production capacity of flexible manufacturing systems is a very important issue in the design of such systems. We propose an approach for determining the production capacity (i.e., the maximum production rate) of a flexible manufacturing system with several part types, dedicated pallets, and fixed production ratios among the different part types. We show that the problem reduces to the determination of a single parameter for which we propose an iterative procedure. Simulation or approximate analytical techniques can be used as the building block performance evaluation technique in the iterative procedure.     

A tool provisioning problem in an FMS

A fundamental decision in designing a flexible manufacturing system (FMS) is the number and types of tools (cutters) to provide for system operation. This tool provisioning decision becomes especially important when space and equipment must be provided for refurbishing and storing tools within the FMS. In this article, we describe in detail the tool provisioning problem for a particular application, discuss approaches to making the tool provisioning decision, and explain why analytic models for this problem may be difficult to develop.     

Work flow control in the flexible flow line

This research involves the development and evaluation of a part flow control model for a type of flexible manufacturing system (FMS) called a dedicated flexible flow line (FFL). In the FFL, all part types flow along the same path between successive machine groups. The specific objective of the part flow control model for the FFL is to minimize makespan for a given set of parts produced in a FFL near-term schedule, given fixed available buffer constraints. The control model developed in this research involved the repeated, real-time execution of a mathematical programming algorithm. The algorithm attempts to release the right mix of parts at the tight time to keep the FFL operating smoothly. The focus of the approach is directed toward managing WIP buffers for each machine group queue. The algorithm specifically incorporates stochastic disturbance factors such as machine failures. Through a limited number of simulation experiments, performance of the control model is shown to be superior to other parts releasing and control methods reported in the literature.     

Controlling flexible manufacturing systems based on a dynamic selection of the appropriate operational criteria and scheduling policy

This study presents the development of a multi-criteria control methodology for flexible manufacturing systems (FMSs). The control methodology is based on a two-tier decision making mechanism. The first tier is designed to select a dominant decision criterion and a relevant scheduling rule set using a rule-based algorithm. In the second tier, using a look-ahead multi-pass simulation, a scheduling rule that best advances the selected criterion is determined. The decision making mechanism was integrated with the shop floor control module that comprises a real-time simulation model at the top control level and RapidCIM methodology at the low equipment control level. A factorial experiment was designed to analyze and evaluate the two-tier decision making mechanism and the effects that the main design parameters have on the system’s performance. Next, the proposed control methodology was compared to a selected group of scheduling rules/policies using DEA. The results demonstrated the superiority of the suggested control methodology as well as its capacity to cope with a fast changing environment.     

An inexact algorithm for part input sequencing and scheduling with side constraints in FMS

Consider a flexible manufacturing system that produces parts of several types. The FMS consists of several groups of pooled, identical machines, a materials handling system, and a set of nonconsumable resources. Each type of part has its own unique sequence in the execution of the operations. An inexact algorithm is presented that sequences and schedules the input of the parts in the FMS by considering constraints such as machine availabilities and other resources in the machine groups, the availability of the transport units, and so on. Primarily, the goal of the algorithm is to minimize makespan and, secondarily, to minimize turnaround time. Several strategies are discussed, and the results are reported. A real-life problem is described.     

Stable Earliest Starting Schedules for Cyclic Job Shops: A Linear System Approach

We consider a cyclic job shop where an identical mixture of parts of different types, called a minimal part set (MPS), is produced repetitively in the same processing order. The precedence relationships among events (start of operation) are represented by a directed graph that has a recurrent structure. Each operation starts as soon as all its preceding operations are complete (called earliest starting). There is a class of desirable schedules that has the minimum cycle time and an identical schedule pattern for every MPS. By using linear system theory on minimax algebra, we characterize the set of all possible such schedules. We develop an efficient algorithm to find one among such schedules that minimizes a performance measure related to work-in-progress inventory. We also discuss an application to a flexible manufacturing system.     

A knowledge-based system for the strategic control level of robots in flexible manufacturing cells

The strategic control level synthesis for robots is related to a hierarchical robot control problem. The main control problem at the strategic control level is to select the model and algorithm to be used by the lower control level to execute the given robot task. Usually there are several lower control level models and algorithms that can be used by the robot control system for every robot task. Strategic control level synthesis depends on the particular robot system application. In a typical application, when the robot system is used in a flexible manufacturing system for manipulating various part types, the robot tasks executed by the robot system depend on the manufacturing processes in the system. If the robot system is applied in another flexible manufacturing system, dedicated to other manufacturing processes, another set of robot tasks might be needed to perform the necessary operations. Therefore, the quantity and the kind of knowledge required in the system for the strategic control level differ from one application to another. Such a fact creates the appropriate conditions for employing some artificial intelligence techniques. This article describes a knowledge-based system approach to the strategic control level synthesis problem.     

Defects tracking matrix for mass customization production based on house of quality

The vision of mass customization has driven a movement toward low volume, high variety mass customization production (MCP) at low price. However, defect identification and defect tracking in such systems are extremely difficult because of the frequent reconfiguration needed by the number of different part types and the interruption of the information flow about quality with each reconfiguration of the system. It is important to quickly rebuild quality information flow with MCP system’s reconfiguration synchronously. This paper introduces a defect tracking method based on Quality Function Deployment for every MCP system module. A defects tracking matrix (DTM) based on the House of Quality directly connects manufacturing technologies with quality defects inside a MCP module. Each MCP reconfiguration requires the DTMs’ rearrangement and DTM-chain is proposed. A dynamic reconstructing algorithm synchronizes the DTM-chain with each MCP reconfiguration. A case study demonstrates the usefulness of the DTM and DTM-chain.     

An efficient heuristic for scheduling batches of parts in a flexible flow system

Flexible manufacturing systems (FMSs) are a class of automated systems that can be used to improve productivity in batch manufacturing. Four stages of decision making have been defined for an FMS—the design, planning, scheduling, and control stages. This research focuses on the planning stage, and specifically in the area of scheduling batches of parts through the system. The literature to date on the FMS planning stage has mostly focused on the machine grouping, tool loading, and parttype selection problems. Our research carries the literature a step further by addressing the problem of scheduling batches of parts. Due to the use of serial-access material-handling systems in many FMSs, the batch-scheduling problem is modeled for a flexible flow system (FFS). This model explicitly accounts for setup times between batches that are dependent on their processing sequence. A heuristic procedure is developed for this batch-scheduling problem—the Maximum Savings (MS) heuristic. The MS heuristic is based upon the savings in time associated with a particular sequence and selecting the one with the maximum savings. It uses a two-phase method, with the savings being calculated in phase I, while a branch-and-bound procedure is employed to seek the best heuristic solution in phase II. Extensive computational results are provided for a wide variety of problems. The results show that the MS heuristic provides good-quality solutions.     

Quality control of an unreliable flexible manufacturing system with scrapping and infinite buffer capacity

Manufacturing multiple part types on a flexible manufacturing system (FMS) is increasingly becoming a rule rather than an exception. In such systems, attention has been drawn to the application of zero-defect technologies. However, in practice, this goal has remained elusive and costly. As a result, even though FMSs may be more reliable, producing fewer defective parts, system complexity and more stringent quality standards are rendering quality control in FMSs potentially useful. The goals of this article are threefold. First, we introduce a procedure for measuring and managing the in-process quality control of an FMS, which is described by an Open Queueing Network (OQN), bridging thereby a gap between queueing theory and quality control. Second, by focusing attention on the potential unreliabilities of FMSs, we provide some managerial insights regarding the role, position, and distribution of the quality control effort in an FMS. Finally, we stress the intricate relations between an FMS's operating characteristics and the manufactured quality and its control. Using numerical analyses, we draw some inferences regarding the design of such FMSs when both quality and quantity issues in the FMSs are considered. These simultaneous considerations of quantity and quality flows in an FMS have not been previously considered in the study of FMSs.     

An Efficient Heuristic Approach to Recognize the Infeasibility of a Loading Problem

The success of hierarchical production planning approaches for flexible manufacturing systems lies in the consistency of decision outcomes at various decision levels. For instance, the loading problem, which is solved at a lower level, may not yield a feasible loading solution to a set of part types selected at a higher level. This paper attemps to address the issue of recognizing the infeasibility of a loading solution. We present a modified loading model that includes a penalty for each operation not assigned to any machine. We develop a Lagrangian-based heuristic procedure and provide a sufficient condition on the quality of heuristic solutions that, if satisfied, will enable us to use the heuristic solutions to recognize the infeasibility of a loading problem. The proposed model and the dual-based heuristic can be effectively incorporated in an FMS hierarchical production planning approach that finds a good loading solution by iteratively comparing different part grouping scenarios.     

Comparison of different neural network algorithms in the diagnosis of acute appendicitis

Four different neural network algorithms, binary adaptive resonance theory (ART1), self-organizing map, learning vector quantization and back-propagation, were compared in the diagnosis of acute appendicitis with different parameter groups. The results show that supervised learning algorithms learning vector quantization and back-propagation were better than unsupervised algorithms in this medical decision making problem. The best results were obtained with the learning vector quantization. The self-organizing map algorithm showed good specificity, but this was in conjunction with lower sensitivity. The best parameter group was found to be the clinical signs. It seems beneficial to design a decision support system which uses these methods in the decision making process.     

A new branch and bound algorithm for loading problems in flexible manufacturing systems

Loading problems in flexible manufacturing systems involve assigning operations for selected part types and their associated tools to machines or machine groups. One of the objectives might be to maximize the expected production rate (throughput) of the system. Because of the difficulty in dealing with this objective directly, a commonly used surrogate objective is the closeness of the actual workload allocation to the continuous workload allocation that maximizes throughput. We test several measures of closeness and discuss correlations between these measures and throughput. Using the best measure, we show how to modify an existing branch and bound algorithm which was developed for the case of equal target workloads for all machine groups to accommodate unequal target workloads. We also develop a new branch and bound algorithm which can be used for both types of problems. The efficiency of the algorithm in finding optimal solutions is achieved through the application of better branching rules and improved dominance results. Computational results on randomly generated test problems indicate that the new algorithm performs well.     

A Genetic Algorithm Approach to the Scheduling of FMSs with Multiple Routes

Usually, most of the typical job shop scheduling approaches deal with the processing sequence of parts in a fixed routing condition. In this paper, we suggest a genetic algorithm (GA) to solve the job-sequencing problem for a production shop that is characterized by flexible routing and flexible machines. This means that all parts, of all part types, can be processed through alternative routings. Also, there can be several machines for each machine type. To solve these general scheduling problems, a genetic algorithm approach is proposed and the concepts of virtual and real operations are introduced. Chromosome coding and genetic operators of GAs are defined during the problem solving. A minimum weighted tardiness objective function is used to define code fitness, which is used for selecting species and producing a new generation of codes. Finally, several experimental results are given.     

A dynamic heuristic-based algorithm to part input sequencing in flexible manufacturing systems for mass customization capability

In the increasingly competitive global markets, enterprises face challenges in responding to customer orders quickly, as well as producing customized products cost-effectively. This paper proposes a dynamic heuristic-based algorithm for the part input sequencing problem of flexible manufacturing systems (FMSs) in a mass customization (MC) environment. The FMS manufactures a variety of parts, and customer orders arrive dynamically with order size as small as one. Segmental set functions are established in the proposed algorithm to apply the strategy of dynamic workload balancing, and the shortest processing time (SPT) scheduling rule. Theoretical analysis is performed and the effectiveness of the algorithm in dynamic workload balancing under the complex and dynamic environment is proven. The application of the algorithm is illustrated by an example. The potential of its practical applications to the FMSs in make-to-order (MTO) supply chains is also discussed. Further research is provided.     

A Comparison Between Machine Flexibility and Routing Flexibility

In this paper, we evaluate two types of flexibility, machine flexibility and routing flexibility, in terms of manufacturing performance in various shop environments. A simulation-based investigation was conducted to analyze the impact of these types of flexibility on the average flow time of parts under various job flow pattern conditions, which characterize the shop nature from a random job shop to a flow shop, operation time variance, setup time, and shop load. The experimental results show how these types of flexibility affect the average flow time of parts and which type is superior under what conditions. Management can obtain better insight and guidelines for determining priorities or the scale, or scope, of various decision items relating to design standardization, process and operations improvement, investment in new equipment and tools, and the like.     

Analysis of flexible manufacturing systems with distinct repeated visits: DrQ

This article examines the performance effects caused by repeated part visits at the workstations of a flexible manufacturing system (FMS). Such repeated part visits to the same workstations are commonly associated with fixture changes for machining complex parts, reclamping, and remounting or reorienting them. Since each of the repeated visits to a workstation may require different processing requirements, the resulting queueing network does not have a product form solution. We therefore develop an approximate mean value analysis model for performance evaluation of an FMS that may produce multiple part types with distinct repeated visits. We provide numerical examples and validate the accuracy of our solution algorithm against simulation. These examples show that the proposed model produces accurate throughput and utilization predictions with minimal computational efforts. These examples reveal that increasing the total pallet population may result in a reduction of the aggregate throughput, and that the FMS's performance could be more sensitive to the mix of pallets and part routes than to the total number of pallets. Our model will be of use, in particular, when managers wish to control individual operations (e.g., to adjust individual operation times to achieve economic savings in tool wear and breakage costs) or to investigate the performance implications of route changes due to alternate assignments of particular manufacturing tasks to certain workstations.     

A model for the minimum cost configuration problem in flexible manufacturing systems

This paper presents a mathematical programming model to help select equipment for a flexible manufacturing system, i.e., the selection of the types and numbers of CNC machines, washing stations, load/unload stations, transportation vehicles, and pallets. The objective is to minimize equipment costs and work-in-process inventory cost, while fulfilling production requirements for an average period. Queueing aspects and part flow interactions are considered with the help of a Jacksonian-type closed queueing network model in order to evaluate the system's performance. Since the related decision problem of our model can be shown to be NP-complete, the proposed solution procedure is based on implicit enumeration. Four bounds are provided, two lower and two upper bounds. A tight lower bound is obtained by linearizing the model through the application of asymptotic bound analysis. Furthermore, asymptotic bound analysis allows the calculation of a lower bound for the number of pallets in the system. The first upper bound is given by the best feasible solution and the second is based on the anti-starshaped form of the throughput function.     

Supervisory Control of Functionally-Expandable Manufacturing Systems

Supervisory controllers have traditionally coordinated the various resources of manufacturing systems, such as flexible manufacturing workcells, for the production of a priori set families of part types. This paper expands on this capability by allowing the control of the production of new part types side by side with previously defined and planned for nominal part types. The proposed basic workcell supervisory-control approach advocates the use of a pair of non-communicating independent supervisors, synthesized individually but working in concert, to achieve the production of existing and new part types: nominal and complementary supervisors, respectively. The nominal supervisor is responsible for controlling the behavior of the nominal system, producing the set of a priori planned-for part types, whereas the complementary supervisor controls the flow of the a priori unplanned-for new part types.