Analytical loading models in flexible manufacturing systems

Computer Integrated Manufacturing Systems, 1993

In this paper the problem of tool management in flexible manufacturing systems (FMS) is investigated. After a brief review of the literature, the problem of dynamical allocation of tools to workcentres is studied by stating an optimization problem which considers both tooling requirements given by work schedules and tool consumption. Some simple examples are given to illustrate the model. What emerges is an optimization problem of a dynamic system with nonlinear control constraints and integer variables, which is too complex to be solved with analytical methods. An heuristic, rule-based approach to this problem is then suggested, along with some results.

Given demand requirements, manufacturing systems should analyze whether or not there is sufficient capacity to perform the technologically-different operations. In a more flexible system, better utilization can be achieved, however, generally with higher cost. To analyze this problem, we extend traditional aggregate planning concepts to address capacity issues in flexible manufacturing systems. A 0-1 integer linear programming model is developed to help determine how to configure a manufacturing system to avoid excessive capacity over-and/or under-utilization. Also, several management priorities, such as tooling cost, machine pooling, and flexibility issues, are considered. The model is illustrated through a sample problem.

The paper addresses a vital pre-release decision that directly affects the operational effectiveness of a flexible manufacturing system- the machine-loading problem. Flexible manufacturing is a concept that allows manufacturing systems to be built under high customized production requirements. Issues such as cutting down of inventories and shortened product life cycles, reducing the cost of products and services to grab more market shares, etc have made it almost compulsory for many companies to switch over to flexible manufacturing systems (FMSs) as a viable means to accomplish the above goals while producing consistently good quality and cost effective products. The combinatorial and NP-hard nature of this problem makes it arduous to secure the best solutions. The objective is minimization of the system unbalance whereas the system's technological constraints are determined by the availability of machining time and tool slots. Due to the large number of random sequences generated as the number of jobs increase, an eliminator function displays and computes the system unbalance only for a fixed number of sequences, thus improving the quality of the solution and reducing the computational burden. The proposed algorithm is test

International Journal for Research in Applied Science & Engineering Technology (IJRASET), 2022

In most organizations, a flexible manufacturing system (FMS) is concerned with the automatic production of different parts in the middle range because it is flexible. In a nutshell, it's a machine that makes everything. FMS relies heavily on the flow of jobs and tools in order to function. The FMS work centre can handle a large number of tasks at once. For FMS facilities, a tool magazine is in use as a means of reducing tool inventory. We present the Jaya method in this work to schedule tasks and tools simultaneously without considering tool transfer delays across machines; this is what we call the make span goal. On numerous make span-related challenges, the suggested heuristic is evaluated and compared with current approaches. The suggested heuristic beats the already used approaches, according to the findings.

The International Journal of Advanced Manufacturing Technology, 1996

The key competitive strength of a manufacturing system lies in its flexibility, which represents the ability to respond effectively to changing circumstances. Flexible manufacturing systems (FMSs) react appropriately to change. The relevance of a particular type of flexibility depends upon the system and problem being considered. In this paper, the machine loading problem in a flexible manufacturing system is addressed. The loading problem is concerned with the allocation of part operations and required tools to the machines, so as to optimise some objective(s) subject to some technological constraints. Several objectives have been considered in the past such as maximisation of the utilisation of resources, minimisation of processing and tooling costs and maximisation of throughput rates. In such procedures, it is quite probable that a rigid loading schedule is obtained and in cases of machine breakdowns and tool failures alternate routeings are often not available. Therefore, in this paper, we develop a mathematical model which considers maximisation of the production routeings available for the parts and hence increases the routeing flexibility. The model is illustrated by examples.

2009

The computerized nature of the flexible manufacturing systems (FMS) makes it readily adaptive to the web-based information system. However, processes run by the FMS may not be fully automatic because of potential resource conflict, i.e. a floating characteristic relationship between system facility and production orders. Since coordination between system facility and unpredictable orders is difficult, this paper will present an off-line simulation approach to reveal the embedded relationship and then avoid the conflicts on-line. The method employs three dispatching rules individually to direct the process flows inside a flexible manufacturing cell, and acquires potential deadlock patterns of part processing sequence from an off-line simulation. Then an on-line matching/reordering process is used to keep the incoming orders dissimilar to the deadlock patterns. Two major advantages have been achieved by the proposed method: it provides an effective routing mechanism for deadlock-free production on randomly arrived orders, and it improves the feasibility of any planned schedules by removing the potential of resource deadlock. This research uses timed Petri nets to simulate the flexible manufacturing cell. Three dispatching rules, which generate pull tendency at cell exit, are employed and compared to demonstrate the routing mechanism.

Journal of Manufacturing Systems, 2012

This paper considers a problem of dynamic machine-tool selection and operation allocation with part and tool movement policies in a flexible manufacturing system (FMS) environment. For this purpose, a novel 0-1 linear integer programming model is presented in such a way that each part and each tool can move during the production phase. It is assumed that there are a given set of tools and machines that can produce different kinds of orders (or part types). The objective of this model is to determine a machine-tool combination for each operation of the part type by minimizing some production costs, such as machining costs, setup costs, material handling costs and tool movement costs. In addition, due to the NP-hard nature of the problem, a new heuristic method based on five simple procedures (FSP) is proposed for solving the given problem, whose performance is tested on a number of randomly generated problems. The related results are compared with results obtained by a branch-and-bound method. It has been found that the proposed heuristic method gives good results in terms of objective function values and CPU times.

Applied Mathematical Modelling, 1989

ANNALS OF THE ORADEA UNIVERSITY. Fascicle of Management and Technological Engineering., 2016

This paper focused on the literature survey of the use of flexible manufacturing system design and operation problems on the basis of simulation tools and their methodology which have been widely used for manufacturing system design and analysis. During this period, simulation has been proving to be an extremely useful analysis and optimization tool, and many articles, papers, and conferences have focused directly on the topic. This paper presents a scenario the use of simulation tools and their methodology in flexible manufacturing system from a period 1982 to 2015.

The Performance Study of Flexible Manufacturing Systems using Hybrid Algorithm Approach, 2021

The goal of today's production strategy is to maximize the advantages of flexibility. Only when a manufacturing system is completely controlled by FMS technology is this possible. With the Process-Product Matrix in mind, it's feasible to see how an industry might achieve high flexibility via creative technological and organizational initiatives. A flexible cell is now defined as two or more CNC machines, while a flexible manufacturing system is defined as two or more cells. In computer science, system engineering, and many other areas, Petri nets are a strong modeling framework. Petri nets are a graphical description of the dynamic behavior of systems that combines a well-defined mathematical theory with a graphical representation of the dynamic behavior of systems. Because each of its aspects may be implemented in a number of ways and with varying degrees of complexity, the scatter search process is very adaptable. To handle scheduling challenges, the Petri Net idea is introduced and compared to the Scatter Search method. When the results of two case studies (9 machines X 2 jobs) are examined, it is shown that Petri Net outperforms Scatter Search in terms of machine usage.