%0 Journal Article %1 HanXingChenLeiWang13 %A Han, Libin %A Xing, Keyi %A Chen, Xiao %A Lei, Hang %A Wang, Feng %D 2013 %I Taylor & Francis %J International Journal of Production Research %K citeulike controllers, deadlock, genetic, nets, petri, scheduling %N 5 %P 1557--1572 %R 10.1080/00207543.2013.849012 %T Deadlock-free genetic scheduling for flexible manufacturing systems using Petri nets and deadlock controllers %U http://dx.doi.org/10.1080/00207543.2013.849012 %V 52 %X In this paper, a new deadlock-free scheduling method based on genetic algorithm and Petri net models of flexible manufacturing systems is proposed. The optimisation criterion is to minimise the makespan. In the proposed genetic scheduling algorithm, a candidate schedule is represented by a chromosome that consists of two sections: route selection and operation sequence. With the support of a deadlock controller, a repairing algorithm is proposed to check the feasibility of each chromosome and fix infeasible chromosomes to feasible ones. A feasible chromosome can be easily decoded to a deadlock-free schedule, which is a sequence of transitions without deadlocks. Different kinds of crossover and mutation operations are performed on two sections of the chromosome, respectively, to improve the performance of the presented algorithm. Computational results show that the proposed algorithm can get better schedules. Furthermore, the proposed scheduling method provides a new approach to evaluate the performance of different deadlock controllers.

@article{HanXingChenLeiWang13, abstract = {{In this paper, a new deadlock-free scheduling method based on genetic algorithm and Petri net models of flexible manufacturing systems is proposed. The optimisation criterion is to minimise the makespan. In the proposed genetic scheduling algorithm, a candidate schedule is represented by a chromosome that consists of two sections: route selection and operation sequence. With the support of a deadlock controller, a repairing algorithm is proposed to check the feasibility of each chromosome and fix infeasible chromosomes to feasible ones. A feasible chromosome can be easily decoded to a deadlock-free schedule, which is a sequence of transitions without deadlocks. Different kinds of crossover and mutation operations are performed on two sections of the chromosome, respectively, to improve the performance of the presented algorithm. Computational results show that the proposed algorithm can get better schedules. Furthermore, the proposed scheduling method provides a new approach to evaluate the performance of different deadlock controllers.}}, added-at = {2017-09-08T10:52:59.000+0200}, author = {Han, Libin and Xing, Keyi and Chen, Xiao and Lei, Hang and Wang, Feng}, biburl = {https://www.bibsonomy.org/bibtex/248426c9faa53f2e8b5ff5cbb7f487984/fernand0}, citeulike-article-id = {13122559}, citeulike-linkout-0 = {http://dx.doi.org/10.1080/00207543.2013.849012}, citeulike-linkout-1 = {http://www.tandfonline.com/doi/abs/10.1080/00207543.2013.849012}, day = 29, doi = {10.1080/00207543.2013.849012}, interhash = {7a26b240423ff7d7df6eea9fba91914e}, intrahash = {48426c9faa53f2e8b5ff5cbb7f487984}, journal = {International Journal of Production Research}, keywords = {citeulike controllers, deadlock, genetic, nets, petri, scheduling}, month = oct, number = 5, pages = {1557--1572}, posted-at = {2014-04-01 11:26:31}, priority = {2}, publisher = {Taylor \& Francis}, timestamp = {2017-09-08T10:53:23.000+0200}, title = {{Deadlock-free genetic scheduling for flexible manufacturing systems using Petri nets and deadlock controllers}}, url = {http://dx.doi.org/10.1080/00207543.2013.849012}, volume = 52, year = 2013 }