A real-time scheduling mechanism for a flexible manufacturing system: Using simulation and dispatching rules

This paper presents a real-time scheduling methodology which uses simulation and dispatching rules for flexible manufacturing systems. We develop a scheduling mechanism in which job dispatching rules vary dynamically based on information from discrete event simulation that is used for evaluating candidate dispatching rules. In this paper, we improve and extend a previous research on simulation-based real-time scheduling by suggesting a more systematic framework for the scheduling mechanism through refinement of functions of modules in the mechanism, and by presenting and analysing various scheduling strategies used to operate the mechanism. The strategies are formed by combining two factors that might influence the performance of the mechanism: type of simulation model which is used in the mechanism and points of time when new dispatching rules are selected. In order to compare performance of the scheduling strategies, computational experiments are performed and results are reported.     

Biogeography-based optimisation for flexible manufacturing system scheduling problem

Biogeography-based optimisation (BBO) algorithm is a new evolutionary optimisation algorithm based on geographic distribution of biological organisms. With probabilistic operators, this algorithm is able to share more information from good solutions to poor ones. BBO prevents the good solutions to be demolished during the evolution. This feature leads to find the better solutions in a short time rather than other metaheuristics. This paper provides a mathematical model which integrates machine loading, part routing, sequencing and scheduling decision in flexible manufacturing systems (FMS). Moreover, it tackles the scheduling problem when various constraints are imposed on the system. Since this problem is considered to be NP-hard, BBO algorithm is developed to find the optimum /near optimum solution based on various constraints. In the proposed algorithm, different types of mutation operators are employed to enhance the diversity among the population. The proposed BBO has been applied to the instances with different size and degrees of complexity of problem adopted from the FMS literature. The experimental results demonstrate the effectiveness of the proposed algorithm to find optimum /near optimum solutions within reasonable time. Therefore, BBO algorithm can be used as a useful solution for optimisation in various industrial applications within a reasonable computation time.     

On-line scheduling in a multi-cell flexible manufacturing system

This paper deals with on-line scheduling in a multi-cell flexible manufacturing system, operating in a produce-to-order environment. A two level distributed production control system (DPCS) is developed and tested through a simulation study. The DPCS allows autonomous and simultaneous operation of each cell-controller, utilizing only local and short term information as well as simple heuristic rules. Simulation experiments show that the proposed DPCS achieves good results in throughput, tardiness of orders and WIP inventory level and that it is robust to machine and handling device failures.     

A scheduling approach for a flexible manufacturing system

This paper discusses the scheduling problem of a particular flexible manufacturing system (FMS). The two main components of the FMS are a CNC turret lathe and a CNC machining centre. In the system a wide range of different jobs has to be processed. Each job consists of one or more processing operations on one or both machines. Important characteristics of the scheduling problem are sequence-dependent change-over times (on the turret lathe) and transfer times (on both machines and between the machines). The change-over times are caused by the need to exchange tools in the turret when a new part is going to be processed. The transfer times reflect the time needed to perform manual transportation and clamping activities between two subsequent processing (machining) operations of a part. In this paper a branch and bound algorithm is described based on an active schedule strategy. Solutions are compared to results obtained by a simple dispatching rule     

A study of scheduling rules of flexible manufacturing systems: A simulation approach

This study examines the effects of scheduling rules on the performance of flexible manufacturing systems (FMSs). Several machine and AGV scheduling rules are tested against the mean flowtime criterion. In general, scheduling rules are widely used in practice ranging from direct applications as a stand-alone scheduling scheme to indirect application as a part of complicated scheduling systems. In this paper, we compare the rules under various experimental conditions by using an FMS simulation model. Our objective is to measure sensitivity of the rules to changes in processing time distributions, various levels of breakdown rates, and types of AGV priority schemes. A comprehensive bibliography is also presented in the paper.     

Heuristic solution to the scheduling problems in flexible manufacturing system

The scheduling problems in flexible manufacturing systems deal with (1) tool allocation (2)parts scheduling (3) pallets scheduling (4) machines scheduling and (5) material handling equipment scheduling. This paper presents an approach to determine an optimal schedule of parts integrating all the above scheduling criteria. The problem is formulated as a hierarchical process and solved through eigenvector analysis of priority ordering. Effectiveness of the heuristic is illustrated with an example.     

Multicriteria dynamic scheduling methodology for controlling a flexible manufacturing system

A methodology is presented for the dynamic scheduling of flexible manufacturing systems (FMSs). A two-level control hierarchy is suggested. The higher level is used for determining a dominant decision criterion and relevant scheduling rules, based on an analysis of the actual shop status. The lower level uses simulation for determining the best scheduling policy to be selected. Simulation is used to evaluate different control options, and once a control decision is made, it is operated in real time to serve as the FMS controller. The suggested scheduling and control scheme is being developed, implemented and tested in a physical computer integrated manufacturing (CIM)/FMS environment at the CIM and Robotics Lab of the Faculty of Industrial Engineering and Management, Technion. This will serve as a test-bed to study the performance of the FMS under different scheduling rules and control options, and to recommend the best combination of control policies and parameters for specific system conditions and global production objectives.     

A bottleneck-based beam search for job scheduling in a flexible manufacturing system

In this paper, we study job-scheduling methods for flexible manufacturing systems (FMSs). Routeing flexibility is a feature that distinguishes FMS scheduling from a classic general jobshop problem. We formalize the problem as a flexible jobshop problem and introduce a flexibility index to measure the extent of routeing flexibility. Based on a procedure to identify a potential bottleneck machine, we develop a beam search method for approximately solving the problem. The proposed method yields a significantly shorter makespan than that of the commonly used shortest processing-time dispatching rule, and it properly exploits the added flexibility in routeing. The computational effort required also is small enough to enable practical implementation.     

An experimental study of human decision-making in computer-based scheduling of flexible manufacturing system

This paper describes a study which explores human decision-making abilities in scheduling and dispatching of a flexible manufacturing system (FMS) An experiment is described, using an FMS, in which subjects make scheduling and dispatching decisions using a real-time interactive computer-simulation based system. The experimental results demonstrate that human decision-making is superior to general dispatching rules. An explanation of these results and an analysis of subjects' behaviour is presented in the light of information obtained from verbal protocol data     

Design and scheduling of hybridmulti-cell flexible manufacturing systems

The objective of this paper is to minimize machine duplication by increasing its utilization, minimize intercell moves, simplify the scheduling problem and increase the flexibility of the manufacturing system. An integrated approach of design and scheduling alternative hybrid multi-cell flexible manufacturing systems (MCFMSs) in four steps will be presented in this paper. The first step is the implementation of branch and bound techniques which provide tools to design group technology (GT) cells. The second step is balancing the inter-cell workload of GT cells which leads to a hybrid MCFMS with better utilization of the machines. The problem of the exception machines and their utilization and workload balance will be solved within the MCFMScentre. Thus the performance of GT cells can be improved by transferring workloads from a congested (bottleneck) machine in one cell to an alternative one, a less congested (exception) machine in another cell within a group of GT cells forming a MCFMS centre. The third step is the group scheduling; a proposed heuristic method will be used for the scheduling of a family of parts with the objective of minimizing the maximum completion time of each part. The problem of scheduling under MCFMS can be reduced by considering the scheduling of each family of parts. Finally, the flexibility of the system will be enhanced by selecting appropriate machine tools and flexible material handling equipments. This approach is both effective and efficient-it has generated a hybrid MCFMS centre which includes several alternatives, for some benchmark problems in much shorter time than algorithms previously reported in the literature. In addition, the method is conceptually simple and easy to implement.     

Performance-based dynamic scheduling model for flexible manufacturing systems

A performance-based dynamic scheduling model for random flexible manufacturing systems (FMSs) is presented. The model is built on the mathematical background of supervisory control theory of discrete event systems. The dynamic FMS scheduling is based on the optimization of desired performance measures. A control theory-based system representation is coupled with a goal programming-based multi-criteria dynamic scheduling algorithm. An effectiveness function, representing a performance index, is formulated to enumerate the possible outputs of future schedules. Short-term job scheduling and dispatching decisions are made based on the values obtained by optimizing the effectiveness function. Preventive actions are taken to reduce the difference between actual and desired target values. To analyse the real-time performance of the proposed model, a software environment that included various Visual Basic Application® modules, simulation package Arena®, and Microsoft Access® database was developed. The experimentation was conducted (a) to determine the optimum look-ahead horizons for the proposed model and (b) to compare the model with conventional scheduling decision rules. The results showed that the proposed model outperformed well-known priority rules for most of the common performance measures.     

A note on the problem of scheduling a flexible manufacturing system for Just-in-time customers

In supplying just-in-time customers, one common industry practice is for the vendor to set up a warehouse near the point of demand. We assume that the plant is a flexible manufacturing system (FMS) where the changeover times between parts of the same family axe. negligible, but not between parts of different families. Thus the FMS must be configured to produce one family of parts at a time. For each part type, we assume that the vendor makes deliveries to the warehouse at fixed intervals. We examined two related issues: the run length for each part family and the number of deliveries to the warehouse in each cycle. We first showed that it is not necessary for the vendor to produce for each delivery, nor is it desirable to complete the entire production lot before delivery. We then investigated the FMS loading problem for two or more part-families. We developed the expressions for the optimal run length and delivery frequency, (1) when loading the part types sequentially and (2) when loading the part types simultaneously. The resulting models can be shown to be consistent with the classical EOQ model.     

Interaction between dispatching and next station selection rules in a dedicated flexible manufacturing system

The interaction between nine dispatching and four next station selection rules in a relatively large dedicated FMS is investigated. The FMS contains 16 workstations with local buffers, nine load/unload stations, and produces six different part types. A simulation model is used, and analysed as a steady-state model. Flowtime is taken as the main criterion. It is found that WINQ (select the station whose input buffer contains the smallest amount of work) dominates, performing significantly better than the other next station selection rules considered across all dispatching rules, with few significant differences between dispatching rules when combined with WINQ. SIO/TOT (select the job with the smallest ratio obtained by dividing the processing time of the imminent operation by the total processing time for the part) performs marginally better than the other dispatching rules, particularly SIO (select the job with the shortest imminent processing time). Reasons for when a next station selection rule is more important than a dispatching rule, and vice versa, are discussed.     

Experimental investigation of FMS machine and AGV scheduling rules against the mean flow-time criterion

Although a significant amount of research has been carried out in the scheduling of flexible manufacturing systems (FMSs), it has generally been focused on developing intelligent scheduling systems. Most of these systems use simple scheduling rules as a part of their decision process. While these scheduling rules have been investigated extensively for a job shop environment, there is little guidance in the literature as to their performance in an FMS environment. This paper attempts to investigate the performances of machine and AGV scheduling rules against the mean flow-time criterion. The scheduling rules are tested under a variety of experimental conditions by using an FMS simulation model.     

A comparison of tool management strategies and part selection rules for a flexible manufacturing system

An important element in the successful operation of flexible manufacturing systems (FMS) is the management of the tooling component. This paper reports on one aspect of tool management for FMS operations. Four tool allocation and scheduling strategies are compared in the presence of three part selection rules through a simulation study of a five-machine FMS with an automated tool handling system. The tool allocation strategies are similar to those used in industry while the part selection rules are synthesized from the literature on FMS scheduling under tooling constraints. The use of different tooling strategies produces significantly different outcomes in FMS performance.     

Integrated scheduling and tool management in flexible manufacturing systems

A multistage algorithm is proposed that will solve the scheduling problem in a flexible manufacturing system by considering the interrelated subproblems of processing time control, tool allocation and machining conditions optimization. The main objective of the proposed algorithm is to minimize total production cost consisting of tooling, operational and tardiness costs. The proposed integrated approach recognizes an important trade-off in automated manufacturing systems that has been largely unrecognized, and which is believed can be effectively exploited to improve production efficiency and lead to substantial cost reductions.     

Deadlock-free scheduling in flexible manufacturing systems using Petri nets

This paper addresses the deadlock-free scheduling problem in Flexible Manufacturing Systems. An efficient deadlock-free scheduling algorithm was developed, using timed Petri nets, for a class of FMSs called Systems of Sequential Systems with Shared Resources (S 4 R). The algorithm generates a partial reachability graph to find the optimal or near-optimal deadlock-free schedule in terms of the firing sequence of the transitions of the Petri net model. The objective is to minimize the mean flow time (MFT). An efficient truncation technique, based on the siphon concept, has been developed and used to generate the minimum necessary portion of the reachability graph to be searched. It has been shown experimentally that the developed siphon truncation technique enhances the ability to develop deadlock-free schedules of systems with a high number of deadlocks, which cannot be achieved using standard Petri net scheduling approaches. It may be necessary, in some cases, to relax the optimality condition for large FMSs in order to make the search effort reasonable. Hence, a User Control Factor (UCF) was defined and used in the scheduling algorithm. The objective of using the UCF is to achieve an acceptable trade-off between the solution quality and the search effort. Its effect on the MFT and the CPU time has been investigated. Randomly generated examples are used for illustration and comparison. Although the effect of UCF did not affect the mean flow time, it was shown that increasing it reduces the search effort (CPU time) significantly.     

Production scheduling decision rules in changing and non-linear environments

Holt at al. (1960) modollod the production scheduling problem with quadratic costs and derived an optimal set of scheduling rules. Our experiment found those rules may not be effective if costs are non-quadratic. This may explain the relative lack of use of these rules in industry.     

Introducing a flexible manufacturing system

Flexible Manufacturing Systems represent a significant investment and their introduction involves a major project for a company. This paper refers to the introduction of FMS in a company. It discusses various management aspects of the project, and its main subject is the simulation modelling of the system. The objectives of the simulation studies are given and the model described. Results are given and commented on, whereby certain capacity limitations were identified. As a result of the studies, weaknesses in the supplier's control software were highlighted and modifications made.     

Loading a flexible manufacturing system

This paper examines the problem of master scheduling for an FMS in Scotland containing six CNC horizontal boring machines. A multiple criteria approach is used to choose the compatible subset of candidate orders for processing by this FMS, subject to resource constraints and potentially conflicting performance objectives. A structured framework for conflict resolution is described and compromise solutions are obtained using standard mathematical programming software.