scholarly journals A Novel MOEA/D for Multiobjective Scheduling of Flexible Manufacturing Systems

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-14 ◽  
Author(s):  
Xinnian Wang ◽  
Keyi Xing ◽  
Chao-Bo Yan ◽  
Mengchu Zhou

This paper considers the multiobjective scheduling of flexible manufacturing systems (FMSs). Due to high degrees of route flexibility and resource sharing, deadlocks often exhibit in FMSs. Manufacturing tasks cannot be finished if any deadlock appears. For solving such problem, this work develops a deadlock-free multiobjective evolutionary algorithm based on decomposition (DMOEA/D). It intends to minimize three objective functions, i.e., makespan, mean flow time, and mean tardiness time. The proposed algorithm can decompose a multiobjective scheduling problem into a certain number of scalar subproblems and solves all the subproblems in a single run. A type of a discrete differential evolution (DDE) algorithm is also developed for solving each subproblem. The mutation operator of the proposed DDE is based on the hamming distance of two randomly selected solutions, while the crossover operator is based on Generalization of Order Crossover. Experimental results demonstrate that the proposed DMOEA/D can significantly outperform a Pareto domination-based algorithm DNSGA-II for both 2-objective and 3-objective problems on the studied FMSs.

SIMULATION ◽  
2019 ◽  
Vol 95 (11) ◽  
pp. 1085-1096 ◽  
Author(s):  
Abdessalem Jerbi ◽  
Achraf Ammar ◽  
Mohamed Krid ◽  
Bashir Salah

The Taguchi method is widely used in the field of manufacturing systems performance simulation and improvement. On the other hand, Arena/OptQuest is one of the most efficient contemporary simulation/optimization software tools. The objective of this paper is to evaluate and compare these two tools applied to a flexible manufacturing system performance optimization context, based on simulation. The principal purpose of this comparison is to determine their performances based on the quality of the obtained results and the gain in the simulation effort. The results of the comparison, applied to a flexible manufacturing system mean flow time optimization, show that the Arena/OptQuest optimization platform outperforms the Taguchi optimization method. Indeed, the Arena/OptQuest permits one, through the lowest experimental effort, to reliably minimize the mean flow time of the studied flexible manufacturing system more than the Taguchi method.


2011 ◽  
Vol 230-232 ◽  
pp. 814-818
Author(s):  
Bin Zeng ◽  
Rui Wang ◽  
Hong Yu Chen

The complex interaction and the high costs of modern manufacturing systems make it necessary to evaluate their use performance. Production scheduling problem is one of the key problems of research of manufacturing systems since with a proper scheduling, the utilization of resources is optimized and orders are produced on time which improves the shop performance and associated cost benefits. However the complexity of modern production systems makes the use of analytical tools more difficult. Thus a computer simulation model of the existing computer integrated manufacturing system based on the control logic that describes the operation of the system is developed to test the performance of different scheduling rules with respect to mean flow time, machine efficiency and total run time as performance measures. According to the results of experiments, the model agrees with the real system.


2017 ◽  
Vol 11 (3) ◽  
pp. 261-270 ◽  
Author(s):  
Yen-Liang Pan ◽  
Ching-Yun Tseng ◽  
Ter-Chan Row

Flexible manufacturing systems exhibit a high degree of resource sharing. Since the parts advancing through the system compete for a finite number of resources, a deadlock may occur. Accordingly, many pioneers make efforts in the issue. However, how to obtain maximally permissive supervisors in deadlock flexible manufacturing system is an extremely difficult and time-consuming problem. In existing literature, place invariant) and graph analysis method are merged called maximal number of forbidding First Bad Marking (FBM) problem to obtained optimal controllers with a small number of control places. However, this prevention just can be used in some special nets. For general cases, deadlocks could still exist. Therefore, this paper tries to propose one improved iterative deadlock prevention policy to solve above disadvantage. Experimental results show that the proposed improved policy can be used in all kinds of nets. In other words, it does improve the drawback of conventional maximal number of forbidding First Bad Marking (FBM) problem technology.


Sign in / Sign up

Export Citation Format

Share Document