%0 Journal Article %1 XingHanZhouWang12 %A Xing, Keyi %A Han, LiBin %A Zhou, MengChu %A Wang, Feng %D 2012 %I IEEE %J Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on %K citeulike control, deadlock, fms, genetic, nets, petri, scheduling %N 3 %P 603--615 %R 10.1109/tsmcb.2011.2170678 %T Deadlock-Free Genetic Scheduling Algorithm for Automated Manufacturing Systems Based on Deadlock Control Policy %U http://dx.doi.org/10.1109/tsmcb.2011.2170678 %V 42 %X Deadlock-free control and scheduling are vital for optimizing the performance of automated manufacturing systems (AMSs) with shared resources and route flexibility. Based on the Petri net models of AMSs, this paper embeds the optimal deadlock avoidance policy into the genetic algorithm and develops a novel deadlock-free genetic scheduling algorithm for AMSs. A possible solution of the scheduling problem is coded as a chromosome representation that is a permutation with repetition of parts. By using the one-step look-ahead method in the optimal deadlock control policy, the feasibility of a chromosome is checked, and infeasible chromosomes are amended into feasible ones, which can be easily decoded into a feasible deadlock-free schedule. The chromosome representation and polynomial complexity of checking and amending procedures together support the cooperative aspect of genetic search for scheduling problems strongly.

@article{XingHanZhouWang12, abstract = {{Deadlock-free control and scheduling are vital for optimizing the performance of automated manufacturing systems (AMSs) with shared resources and route flexibility. Based on the Petri net models of AMSs, this paper embeds the optimal deadlock avoidance policy into the genetic algorithm and develops a novel deadlock-free genetic scheduling algorithm for AMSs. A possible solution of the scheduling problem is coded as a chromosome representation that is a permutation with repetition of parts. By using the one-step look-ahead method in the optimal deadlock control policy, the feasibility of a chromosome is checked, and infeasible chromosomes are amended into feasible ones, which can be easily decoded into a feasible deadlock-free schedule. The chromosome representation and polynomial complexity of checking and amending procedures together support the cooperative aspect of genetic search for scheduling problems strongly.}}, added-at = {2017-09-08T10:52:59.000+0200}, author = {Xing, Keyi and Han, LiBin and Zhou, MengChu and Wang, Feng}, biburl = {https://www.bibsonomy.org/bibtex/2eee5dd2e6e4483ca2c7e3d56fcdcacc4/fernand0}, citeulike-article-id = {12283168}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/tsmcb.2011.2170678}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6082462}, doi = {10.1109/tsmcb.2011.2170678}, institution = {State Key Lab. for Manuf. Syst. Eng., Xi”an Jiaotong Univ., Xi”an, China}, interhash = {5fe0baa7ad058f6ed5e3c40347d36fe9}, intrahash = {eee5dd2e6e4483ca2c7e3d56fcdcacc4}, issn = {1083-4419}, journal = {Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on}, keywords = {citeulike control, deadlock, fms, genetic, nets, petri, scheduling}, month = jun, number = 3, pages = {603--615}, posted-at = {2013-04-19 10:58:13}, priority = {2}, publisher = {IEEE}, timestamp = {2017-09-08T10:53:23.000+0200}, title = {{Deadlock-Free Genetic Scheduling Algorithm for Automated Manufacturing Systems Based on Deadlock Control Policy}}, url = {http://dx.doi.org/10.1109/tsmcb.2011.2170678}, volume = 42, year = 2012 }