Clonal selection algorithms for task scheduling in a flexible manufacturing cell with supervisory control

A new approach for the problem of optimal task scheduling in a manufacturing cell is proposed in this work, as a combination of a clonal algorithm with the supervisory control of discrete-event dynamical systems. Two methodologies are proposed. In the first one, the clonal selection algorithm (CSA) performs the search for the optimal solution, using randomized searches over permutations of sequences of operations. The supervisory control has the role of encoding all the problem constraints, allowing for the search to be conducted on the feasible solution set only. The second methodology is similar, but the CSA uses a local search 2-opt to improve the best individual of each generation. The preliminary results show that both methodologies can obtain significant gains in the total plant operation time in relation to the greedy control policy employed on an example system considered here. A better performance of the CSA + 2-opt methodology can also be observed, when compared with the Clonal Selection Algorithm alone. The proposed methodology provides robustness and flexibility to the solutions - these features are not usually present in most optimization-based solutions for those problems.

[1]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[2]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[3]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[4]  Jing Huang,et al.  Optimal Nonblocking Directed Control of Discrete Event Systems , 2007, 2007 American Control Conference.

[5]  J.E.R. Cury,et al.  New results on the nonconflict test of modular supervisors , 2008, 2008 9th International Workshop on Discrete Event Systems.

[6]  Jana Kosecka,et al.  Control of Discrete Event Systems , 1992 .

[7]  José Eduardo Ribeiro Cury,et al.  Multitasking Supervisory Control of Discrete-Event Systems , 2005, Discret. Event Dyn. Syst..

[8]  W. M. Wonham,et al.  Supervisor Reduction for Discrete-Event Systems , 2004, Discret. Event Dyn. Syst..

[9]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[10]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[11]  A. F. Vaz,et al.  On supervisor reduction in discrete-event systems , 1986 .

[12]  C SIAMJ.,et al.  AN OPTIMAL CONTROL THEORY FOR DISCRETE EVENT SYSTEMS , 1998 .

[13]  Stéphane Lafortune,et al.  On the synthesis of optimal schedulers in discrete event control problems with multiple goals , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[14]  Yaochu Jin,et al.  Knowledge incorporation in evolutionary computation , 2005 .

[15]  José E. R. Cury,et al.  Modular Supervisory Control of Large Scale Discrete Event Systems , 2000 .

[16]  Rui Zhang,et al.  A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective , 2011, Comput. Oper. Res..

[17]  Fernando José Von Zuben,et al.  Learning and optimization using the clonal selection principle , 2002, IEEE Trans. Evol. Comput..