Production planning of a flexible manufacturing system in a material requirements planning environment

Early flexible manufacturing system (FMS) production planning models exhibited a variety of planning objectives; typically, these objectives were independent of the overall production environment. More recently, some researchers have proposed hierarchical production planning and scheduling models for FMS. In this article, we examine production planning of FMS in a material requirements planning (MRP) environment. We propose a hierarchical structure that integrates FMS production planning into a closed-loop MRP system. This structure gives rise to the FMS/MRP rough-cut capacity planning (FMRCP) problem, the FMS/MRP grouping and loading (FMGL) problem, and the FMS/MRP detailed scheduling problem. We examine the FMRCP and FMGL problems in detail and present mathematical programming models for each of these problems. In particular, the FMRCP problem is modeled as a generalized assignment problem (GAP), and a GAP-based heuristic procedure is defined for the problem. We define a two-phase heuristic for the FMGL problem and present computational experience with both heuristics. The FMRCP heuristic is shown to solve problems that exhibit a dependent-demand relation within the FMS and with FMS capacity utilization as high as 99 percent. The FMGL heuristic requires very little CPU time and obtains solutions to the test problems that are on average within 1.5 percent of a theoretical lower bound. This FMS/MRP production planning framework, together with the resulting models, constitutes an important step in the integration of FMS technology with MRP production planning. The hierarchical planning mechanism directly provides for system-level MRP planning priorities to induce appropriate production planning and control objectives on the FMS while simultaneously allowing for necessary feedback from the FMS. Moreover, by demonstrating the tractability of the FMRCP and FMGL problems, this research establishes the necessary groundwork upon which to explore systemwide issues pertaining to the coordination of the hierarchical structure.     

Effectiveness of flexible routing control

Flexibility in part process representation and in highly adaptive routing algorithms are two major sources for improvement in the control of flexible manufacturing systems (FMSs). This article reports the investigation of the impact of these two kinds of flexibilities on the performance of the system. We argue that, when feasible, the choices of operations and sequencing of the part process plans should be deferred until detailed knowledge about the real-time factory state is available. To test our ideas, a flexible routing control simulation system (FRCS) was constructed and a programming language for modeling FMS part process plans, control strategies, and environments of the FMS was designed and implemented. In addition, a scheme for implementing flexible process routing called data flow dispatching rule (DFDR) was derived. The simulation results indicate that flexible processing can reduce mean flow time while increasing system throughput and machine utilization. We observed that this form of flexibility makes automatic load balancing of the machines possible. On the other hand, it also makes the control and scheduling process more complicated and calls for new control algorithms.     

Near optimal manufacturing flow controller design

Flow control of flexible manufacturing systems (FMSs) addresses an important real-time scheduling requirement of modern manufacturing facilities, which are prone to failures and other controllable or stochastic discrete events affecting production capacity, such as change of setup and maintenance scheduling. Flow controllers are useful both in the coordination of interconnected flexible manufacturing cells through distributed scheduling policies and in the hierarchical decomposition of the planning and scheduling problem of complex manufacturing systems. Optimal flow-control policies are hedging-point policies characterized by a generally intractable system of stochastic partial differential equations. This article proposes a near optimal controller whose design is computationally feasible for realistic-size systems. The design exploits a decomposition of the multiple-part-type problem to many analytically tractable one-part-type problems. The decomposition is achieved by replacing the polyhedra production capacity sets with inscribed hypercubes. Stationary marginal densities of state variables are computed iteratively for successive trial controller designs until the best inscribed hypercubes and the associated optimal hedging points are determined. Computational results are presented for an illustrative example of a failureprone FMS.     

The Effects of Scheduling Rules and Routing Flexibility on the Performance of a Random Flexible Manufacturing System

The increased use of flexible manufacturing systems to efficiently provide customers with diversified products has created a significant set of operational challenges for managers. Many issues concerning procedures and policies for the day-to-day operation of these systems still are unresolved. Previous studies in this area have concentrated on various problems by isolating or simplifying the systems under study. The primary objective of this study is to extend previous research by examining the effects of scheduling rules and routing flexibility on the performance of a constrained, random flexible manufacturing system (FMS). Other experimental factors considered are shop load, shop configuration, and system breakdowns. Within the bounds of this experiment, the results indicate that, in the presence of total routing flexibility, the effects of shop load, system breakdowns, and scheduling rules are significantly dampened. In particular, when total routing flexibility exists, the choice of scheduling rules is not critical. We also show that the behavior of scheduling rules in a more constrained FMS environment (i.e., where system breakdowns occur and material handling capability is limited) is consistent with the findings of previous research conducted under less constrained environments. Finally, results indicate that the shop configuration factor has little or no impact on a system's flow-time performance.     

Scheduling tasks and vehicles in a flexible manufacturing system

Due to their increasing applicability in modern industry, flexible manufacturing systems (FMSs), their design, and their control have been studied extensively in the recent literature. One of the most important issues that has arisen in this context is the FMS scheduling problem. This article is concerned with a new model of an FMS system, motivated by the practical application that takes into account both machine and vehicle scheduling. For the case of a given machine schedule, a simple polynomial-time algorithm is presented that checks the feasibility of a vehicle schedule and constructs it whenever one exists. Then a dynamic programming approach to construct optimal machine and vehicle schedules is proposed. This technique results in a pseudopolynomialtime algorithm for a fixed number of machines.     

A distributed knowledge-based approach to flexible automation: The contract net framework

This article applied distributed artificial intelligence to the real-time planning and control of flexible manufacturing systems (FMS) consisting of asynchronous manufacturing cells. A knowledge-based approach is used to determine the course of action, resource sharing, and processor assignments. Within each cell there is an embedded automatic planning system that executes dynamic scheduling and supervises manufacturing operations. Because of the decentralized control, real-time task assignments are carried out by a negotiation process among cell hosts. The negotiation process is modeled by augmented Petri nets —the combination of production rules and Petri nets—and is excuted by a distributed, rule-based algorithm.     

A Cascading Auction Protocol as a Framework for Integrating Process Planning and Heterarchical Shop Floor Control

A new contract net-style auction protocol is proposed as a framework for integrating process planning and shop floor control in heterarchical manufacturing systems. Process planning is partitioned into on-line and off-line activities; off-line process planning decisions are represented in a graph format and used as input for on-line process planning activities performed by machine controllers. Triggered by the opening round of an auction, the final on-line stages of process planning are dovetailed with the resource allocation process in the shop floor control system. The auction process allows final process planning decisions to be based on timely information, relying on the distribution of static process planning information rather than the distribution of a model of dynamic shop floor status and allowing a controller to identify all the primary and secondary resources and operations that must be provided for the incremental processing of a part.     

A job-shop scheduling approach for optimising sugarcane rail operations

The sugarcane transport system is very complex and uses a daily schedule, consisting of a set of locomotives runs, to satisfy the requirements of the mill and harvesters. The total cost of sugarcane transport operations is very high; over 35% of the total cost of sugarcane production in Australia is incurred in cane transport. Producing efficient schedules for sugarcane transport can reduce the cost and limit the negative effects that this system can have on the raw sugar production system. In this paper, the sugarcane rail operations are formulated as a blocking job shop scheduling problem. A mixed integer programming approach is used to formulate the shop job scheduling problem. Mixed integer programming and constraint programming search techniques are integrated for solving the problem. A case study is solved to test the approach.     

Rule-based production planning in flexible manufacturing systems

Production planning in flexible manufacturing may require the solution of a large-scale discrete-event dynamic stochastic optimization problem, due to the complexity of the system to be optimized, and to the occurrence of discrete events (new orders and hard failures). The production planning problem is here approached for a multistage multipart-type manufacturing shop, where each work cell can share its processing time among the different types of parts. The solution of this problem is obtained by an open-loop-feedback control strategy, updated each time a new event occurs. At each event time, two coupled problems are solved: 1) a product-order scheduling problem, conditioned on estimated values of the production capacities of all component work cells; and 2) a production-capacity planning problem, conditioned on predefined sequences of the product orders to be processed. In particular, the article aims at defining a production planning procedure that integrates both analytical tools, derived from mathematical programming, and knowledge-based rules, coming from experience. The objective is to formulate a hybrid (knowledge-based/analytical) planning architecture, and to analyze its use for multicell multipart-type manufacturing systems.     

Steady-State Analysis and Scheduling of Cyclic Job Shops with Overtaking

A cyclic shop is a production system that repeatedly produces identical sets of parts of multiple types, called minimal part sets (MPSs), in the same loading and processing sequence. A different part type may have a different machine visit sequence. We consider a version of cyclic job shop where some operations of an MPS instance are processed prior to some operations of the previous MPS instances. We call such a shop an overtaking cyclic job shop (OCJS). The overtaking degree can be specified by how many MPS instances the operations of an MPS instance can overtake. More overtaking results in more work-in-progress, but reduces the cycle time, in general. We prove that for a given processing sequence of the operations at each machine, under some conditions, an OCJS has a stable earliest starting schedule such that each operation starts as soon as its preceding operations are completed, the schedule repeats an identical timing pattern for each MPS instance, and the cycle time is kept to be minimal. To do these, we propose a specialized approach to analyzing steady states for an event graph model of an OCJS that has a cyclic structure, which can keep the MPS-based scheduling concept. Based on the steady-state results, we develop a mixed integer programming model for finding a processing sequence of the operations at each machine and the overtaking degrees, if necessary, that minimize the cycle time.     

A New Cyclic Scheduling Algorithm for Flexible Manufacturing Systems

Flexible manufacturing system control is an NP-hard problem. A cyclic approach has been demonstrated to be adequate for an infinite scheduling problem because of maximal throughput reachability. However, it is not the only optimization criterion in general. In this article we consider the minimization of the work in process (WIP) as an economical and productivity factor. We propose a new cyclic scheduling algorithm giving the maximal throughput (a hard constraint) while minimizing WIP. This algorithm is based on progressive operations placing. A controlled beam search approach has been developed to determine at each step the schedule of the next operations. After presenting the main principles of the algorithm, we compare our approach to several most known cyclic scheduling algorithms using a significant existing example from the literature.     

Intelligent scheduling of FMSs with inductive learning capability using neural networks

With the growing uncertainty and complexity in the manufacturing environment, most scheduling problems have been proven to be NP-complete and this can degrade the performance of conventional operations research (OR) techniques. This article presents a system-attribute-oriented knowledge-based scheduling system (SAOSS) with inductive learning capability. With the rich heritage from artificial intelligence (AI), SAOSS takes a multialgorithm paradigm which makes it more intelligent, flexible, and suitable than others for tackling complicated, dynamic scheduling problems. SAOSS employs an efficient and effective inductive learning method, a continuous iterative dichotomister 3 (CID3) algorithm, to induce decision rules for scheduling by converting corresponding decision trees into hidden layers of a self-generated neural network. Connection weights between hidden units imply the scheduling heuristics, which are then formulated into scheduling rules. An FMS scheduling problem is also given for illustration. The scheduling results show that the system-attribute-oriented knowledge-based approach is capable of addressing dynamic scheduling problems.     

The Application of Enterprise Modeling for Aerospace Manufacturing System Integration

The objective of enterprise modeling is to develop a repository regarding organizational elements and functions that maps information objectives with business functions. This is accomplished through an exhaustive process that analyzes and models the business to a level of detail sufficient to enable selection of appropriate technologies and the design of specific information systems. In this paper, enterprise modeling is utilized to provide a baseline reference for the successful integration of an FMS in an aerospace electronics manufacturing facility.     

Towards an Integration of Process Planning and Production Planning and Control for Flexible Manufacturing Systems

This introduction article attempts to present some major issues relating to the integration of process planning and production planning and control (PPC) for flexible manufacturing systems (FMSs). It shows that the performance of an FMS can be significantly improved and FMS capabilities more effectively utilized by integrating process planning and PPC functions. The various types of flexibility to be planned and provided for in process planning and manufacturing are summarized in the article, as well as emerging conceptual frameworks for integration, along with their implementation requirements and problems. Distinctive elements that differentiate these frameworks, such as the extent of integration of process planning and PPC activities, number of alternative process plans, and the time at which numerical control programs are generated, are discussed, followed by a brief summary of the articles compiled for this special issue.     

A Dynamic Tool Requirement Planning Model for Flexible Manufacturing Systems

Despite their strategic potential, tool management issues in flexible manufacturing systems (FMSs) have received little attention in the literature. Nonavailability of tools in FMSs cuts at the very root of the strategic goals for which such systems are designed. Specifically, the capability of FMSs to economically produce customized products (flexibility of scope) in varying batch sizes (flexibility of volume) and delivering them on an accelerated schedule (market response time) is seriously hampered when required tools are not available at the time needed. On the other hand, excess inventory of tools in such systems represents a significant cost due to the expensive nature of FMS tool inventory. This article constructs a dynamic tool requirement planning (DTRP) model for an FMS tool planning operation that allows dynamic determination of the optimal tool replenishments at the beginning of each arbitrary, managerially convenient, discrete time period. The analysis presented in the article consists of two distinct phases: In the first phase, tool demand distributions are obtained using information from manufacturing production plans (such as master production schedule (MPS) and material requirement plans (MRP)) and general tool life distributions fitted on actual time-to-failure data. Significant computational reductions are obtained if the tool failure data follow a Weibull or Gamma distribution. In the second phase, results from classical dynamic inventory models are modified to obtain optimal tool replenishment policies that permit compliance with such FMS-specific constraints as limited tool storage capacity and part/tool service levels. An implementation plan is included.     

Real-time software methodologies: Are they suitable for developing Manufacturing control software?

Computer-Integrated Manufacturing (CIM) systems may be classified as real-time systems. Hence, the applicability of methodologies that are developed for specifying, designing, implementing, testing, and evolving real-time software is investigated in this article. The paper highlights the activities of the software development process. Among these activities, a great emphasis is placed on automating the software requirements specification activity, and a set of formal models and languages for specifying these requirements is presented. Moreover, a synopsis of the real-time software methodologies that have been implemented by the academic and industrial communities is presented together with a critique of the strengths and weaknesses of these methodologies. The possible use of the real-time methodologies in developing the control software of efficient and dependable manufacturing systems is explored. In these systems, efficiency is achieved by increasing the level of concurrency of the operations of a plan, and by scheduling the execution of these operations with the intent of maximizing the utilization of the devices of their systems. On the other hand, dependability requires monitoring the operations of these systems. This monitoring activity facilitates the detection of faults that may occur when executing the scheduled operations of a plan, recovering from these faults, and, whenever feasible, resuming the original schedule of the system. The paper concludes that the set of surveyed methodologies may be used to develop the real-time control software of efficient and dependable manufacturing systems. However, an integrated approach to planning, scheduling, and monitoring the operations of these systems will significantly enhance their utility, and no such approach is supported by any of these methodologies.     

Order Release and Product Mix Coordination in a Complex PCB Manufacturing Line with Batch Processors

In this paper, we study the role of order releases and product mix coordination in a complex manufacturing line with batch processors. We develop a planning methodology for synchronizing production in such manufacturing lines and discuss the decision-making process in the context of a PCB production environment at Northern Telecom's Fiberworld Division. The planning methodology includes developing mathematical programming models for determining a configuration of batch processors, order releases to the shop floor, and daily loading decisions at the batch processors. The optimization models are linked to a simulation model of the shop, which provides key statistics like lead time, work in process, and utilization rates. The objective is to reduce lead time for manufacturing different products in this environment while meeting the demand. We analyze the performance of such a line, study the efficacy of various types of shop floor synchronization policies, and establish the role of batch processors in managing such complex lines effectively. We exhibit how batch processors (which are bottleneck operations) could be scheduled effectively to incorporate the logical constraints that govern their operations and react to variabilities in the manufacturing line.     

Dissimilarity Maximization Method for Real-time Routing of Parts in Random Flexible Manufacturing Systems

This paper presents a dissimilarity maximization method (DMM) for real-time routing selection and compares it via simulation with typical priority rules commonly used in scheduling and control of flexible manufacturing systems (FMSs). DMM aims to reduce the congestion in the system by selecting a routing for each part among its alternative routings such that the overall dissimilarity among the selected routings is maximized. In order to evaluate the performance of DMM, a random FMS, where the product mix is not known prior to production and off-line scheduling is not possible, is selected for the simulation study. A software environment that consists of a computer simulation model, which mimics a physical system, a C++ module, and a linear program solver is used to implement the DMM concept. In addition to DMM, the simulation study uses two priority rules for routing (i.e., machine) selection and seven priority rules for selecting parts awaiting service at machine buffers. The results show (1) DMM outperforms the other two routing selection rules on production rate regardless of the part selection rule used, and (2) its performance is highly dependent on the part selection rules it is combined with.     

A decision-making approach to the operation of flexible manufacturing systems

This paper introduces a generic decision-making framework for assigning resources of a manufacturing system to production tasks. Resources are broadly defined production units, such as machines, human operators, or material handling vehicles; and tasks are activities performed by resources. In the specific context of FMS, resources correspond to individual machines; tasks correspond to operations to be performed on parts. The framework assumes a hierarchical structure of the system and calls for the execution of four consecutive steps to make a decision for the assignment of a resource to a task. These steps are 1) establishment of decision-making criteria, 2) formation of alternative assignments, 3) estimation of the consequences of the assignments, and 4) selection of the best alternative assignment. This framework has been applied to an existing FMS as an operational policy that decides what task will be executed on which resource of this FMS. Simulation runs provide some initial results of the application of this policy. It is shown that the policy provides flexibility in terms of system performance and computational effort.