scholarly journals A Pareto-based genetic algorithm for multi-objective scheduling of automated manufacturing systems

2020 ◽  
Vol 12 (1) ◽  
pp. 168781401988529 ◽  
Author(s):  
Xin Zan ◽  
Zepeng Wu ◽  
Cheng Guo ◽  
Zhenhua Yu
Keyword(s):  
Genetic Algorithm ◽  
Performance Optimization ◽  
Manufacturing Systems ◽  
Manufacturing System ◽  
Automated Manufacturing ◽  
Scheduling Problems ◽  
Automated Manufacturing Systems ◽  
Multi Objective ◽  
Automated Manufacturing System ◽  
And Performance

This work focuses on multi-objective scheduling problems of automated manufacturing systems. Such an automated manufacturing system has limited resources and flexibility of processing routes of jobs, and hence is prone to deadlock. Its scheduling problem includes both deadlock avoidance and performance optimization. A new Pareto-based genetic algorithm is proposed to solve multi-objective scheduling problems of automated manufacturing systems. In automated manufacturing systems, scheduling not only sets up a routing for each job but also provides a feasible sequence of job operations. Possible solutions are expressed as individuals containing information of processing routes and the operation sequence of all jobs. The feasibility of individuals is checked by the Petri net model of an automated manufacturing system and its deadlock controller, and infeasible individuals are amended into feasible ones. The proposed algorithm has been tested with different instances and compared to the modified non-dominated sorting genetic algorithm II. The experiment results show the feasibility and effectiveness of the proposed algorithm.

Facilitating ease of system reconfiguration through measures of manufacturing modularity

2008 ◽  
Vol 222 (10) ◽  
pp. 1275-1288 ◽  
Author(s):  
A M Farid
Keyword(s):  
Manufacturing Systems ◽  
Manufacturing System ◽  
Automated Manufacturing ◽  
Reconfigurable Manufacturing Systems ◽  
Reconfigurable Manufacturing ◽  
Automated Manufacturing Systems ◽  
System Reconfiguration ◽  
Qualitative Understanding ◽  
System Interfaces ◽  
Changes Over Time

In recent years, many design approaches have been developed for automated manufacturing systems in the fields of reconfigurable manufacturing systems (RMSs), holonic manufacturing systems (HMSs), and multiagent systems (MASs). One of the principle reasons for these developments has been to enhance the reconfigurability of a manufacturing system, allowing it to adapt readily to changes over time. However, to date reconfigurability assessment has been limited. Hence the efficacy of these design approaches remains inconclusive. This paper is the second of two in this issue to address reconfigurability measurement. Specifically, ‘reconfiguration ease’ has often been qualitatively argued to depend on the system's modularity. For this purpose, this paper develops modularity measures in a three-step approach. Firstly, the nature of typical manufacturing system interfaces is discussed. Next, the qualitative understanding underlying existing modularity measures is distilled. Finally, these understandings are synthesized for a manufacturing system context. This approach forms the second of two pillars that together lay the foundation for an integrated reconfigurability measurement process described elsewhere.

Production degrees of freedom as manufacturing system reconfiguration potential measures

2008 ◽  
Vol 222 (10) ◽  
pp. 1301-1314 ◽  
Author(s):  
A M Farid ◽  
D C McFarlane
Keyword(s):  
Manufacturing Systems ◽  
Degrees Of Freedom ◽  
Manufacturing System ◽  
Automated Manufacturing ◽  
Reconfigurable Manufacturing ◽  
Multi Agent Systems ◽  
Automated Manufacturing Systems ◽  
System Reconfiguration ◽  
Multi Agent ◽  
Changes Over Time

In recent years, many design approaches have been developed for automated manufacturing systems in the fields of reconfigurable manufacturing systems (RMSs), holonic manufacturing systems (HMSs), and multi-agent systems (MASs). One of the principle reasons for these developments has been to enhance the reconfigurability of a manufacturing system, allowing it to adapt readily to changes over time. However, to date, reconfigurability assessment has been limited. Hence, the efficacy of these design approaches remains inconclusive. This paper is the first of two in this issue to address reconfigurability measurement. Specifically, it seeks to address ‘reconfiguration potential’ by analogy. Mechanical degrees of freedom have been used in the field of mechanics as a means of determining the independent directions of motion of a mechanical system. By analogy, manufacturing degrees of freedom can be used to determine independent ways of production. Furthermore, manufacturing degrees of freedom can be classified into their production and product varieties. This paper specifically focuses on the former to measure the product-independent aspects of manufacturing system ‘reconfiguration potential’. This approach will be added to complementary work on the measurement of ‘reconfiguration ease’ so as to form an integrated reconfigurability measurement process described elsewhere [1—5].

scholarly journals A Multistep Look-Ahead Deadlock Avoidance Policy for Automated Manufacturing Systems

2017 ◽  
Vol 2017 ◽  
pp. 1-16 ◽  
Author(s):  
Chao Gu ◽  
Zhiwu Li ◽  
Abdulrahman Al-Ahmari
Keyword(s):  
Petri Nets ◽  
Manufacturing Systems ◽  
Polynomial Complexity ◽  
Deadlock Avoidance ◽  
Automated Manufacturing ◽  
Automated Manufacturing Systems ◽  
Look Ahead ◽  
Unit Capacity ◽  
Automated Manufacturing System ◽  
Intractable Problem

For an automated manufacturing system (AMS), it is a computationally intractable problem to find a maximally permissive deadlock avoidance policy (DAP) in a general case, since the decision on the safety of a reachable state is NP-hard. This paper focuses on the deadlock avoidance problem for systems of simple sequential processes with resources (S3PR) by using Petri nets structural analysis theory. Inspired by the one-step look-ahead DAP that is an established result, which is of polynomial complexity, for an S3PR without one-unit-capacity resources shared by two or more resource-transition circuits (in the Petri net model) that do not include each other, this research explores a multiple-step look-ahead deadlock avoidance policy for a system modeled with an S3PR that contains a shared one-unit-capacity resource in resource-transition circuits. It is shown that the development of an optimal DAP for the considered class of Petri nets is also of polynomial complexity. It is indicated that the steps needed to look ahead in a DAP depend on the structure of the net model. A number of examples are used to illustrate the proposed method.

Analysis of the Flow-Type Manufacturing Systems Using the Cyclic Queuing Theory

1978 ◽  
Vol 100 (4) ◽  
pp. 468-474 ◽  
Author(s):  
K. Hitomi ◽  
M. Nakajima ◽  
Y. Osaka
Keyword(s):  
Production Rate ◽  
Queuing Theory ◽  
Manufacturing Systems ◽  
Manufacturing System ◽  
Optimal Number ◽  
Automated Manufacturing ◽  
Transfer Lines ◽  
Flow Type ◽  
Automated Manufacturing System ◽  
Computational Procedures

A stochastic mathematical model was built and solved by using cyclic queuing theory for the multistage flow-type automated manufacturing system which is composed of several automated machine tools, movable pallets, transfer lines, and workpiece loading/unloading equipment, in an attempt to investigate the system’s behaviors such as production rate of a machine utilized in each stage, production rate of the system, mean number of waiting pallets at each stage, mean number of in-process inventories in each stage, and cycle time of a pallet. In case of limited space for in-process inventory at each stage, it was found that there exists the optimal number of pallets on the transfer line to maximize production rate. In addition, the computational procedures for analyzing the automated manufacturing system were developed and used to solve typical examples of the automated manufacturing system.

Sign in / Sign up

Export Citation Format

Share Document