%0 Journal Article %1 citeulike:14312513 %A Lei, Hang %A Xing, Keyi %A Han, Libin %A Gao, Zhenxin %D 2017 %J Applied Soft Computing %K citeulike imported %P 413--423 %R 10.1016/j.asoc.2017.01.045 %T Hybrid heuristic search approach for deadlock-free scheduling of flexible manufacturing systems using Petri nets %U http://dx.doi.org/10.1016/j.asoc.2017.01.045 %V 55 %X Deadlock control and scheduling for flexible manufacturing system is integrated. Deadlock control policy is embedded into the heuristic search algorithm. Two hybrid deadlock-free scheduling algorithms for flexible manufacturing system are proposed. Based on the Petri net models of flexible manufacturing systems (FMSs), this paper focuses on deadlock-free scheduling problem with the objective of minimizing the makespan. Two hybrid heuristic search algorithms for solving such scheduling problems of FMSs are proposed. To avoid deadlocks, the deadlock control policy is embedded into heuristic search strategies. The proposed algorithms combine the heuristic best-first strategy with the controlled backtracking strategy based on the execution of the Petri nets. The scheduling problem is transformed into a heuristic search problem in the reachability graph of the Petri net, and a schedule is a transition sequence from the initial marking to the final marking in the reachability graph. By using the one-step look-ahead method in the deadlock control policy, the safety of a state in the reachability graph is checked, and hence, deadlock is avoided. Experimental results are provided and indicate the effectiveness of the proposed hybrid heuristic search algorithms in solving deadlock-free scheduling problems of FMSs. Especially, the comparison against previous work shows that both new algorithms are promising in terms of solution quality and computing times. Based on the Petri net models of flexible manufacturing systems, this paper focuses on deadlock-free scheduling problem with the objective of minimizing the makespan. To avoid deadlocks, the deadlock control policy is embedded into heuristic search strategies, and two hybrid heuristic search algorithms for deadlock-free scheduling of FMSs are proposed.

@article{citeulike:14312513, abstract = {{ Deadlock control and scheduling for flexible manufacturing system is integrated. Deadlock control policy is embedded into the heuristic search algorithm. Two hybrid deadlock-free scheduling algorithms for flexible manufacturing system are proposed. Based on the Petri net models of flexible manufacturing systems (FMSs), this paper focuses on deadlock-free scheduling problem with the objective of minimizing the makespan. Two hybrid heuristic search algorithms for solving such scheduling problems of FMSs are proposed. To avoid deadlocks, the deadlock control policy is embedded into heuristic search strategies. The proposed algorithms combine the heuristic best-first strategy with the controlled backtracking strategy based on the execution of the Petri nets. The scheduling problem is transformed into a heuristic search problem in the reachability graph of the Petri net, and a schedule is a transition sequence from the initial marking to the final marking in the reachability graph. By using the one-step look-ahead method in the deadlock control policy, the safety of a state in the reachability graph is checked, and hence, deadlock is avoided. Experimental results are provided and indicate the effectiveness of the proposed hybrid heuristic search algorithms in solving deadlock-free scheduling problems of FMSs. Especially, the comparison against previous work shows that both new algorithms are promising in terms of solution quality and computing times. Based on the Petri net models of flexible manufacturing systems, this paper focuses on deadlock-free scheduling problem with the objective of minimizing the makespan. To avoid deadlocks, the deadlock control policy is embedded into heuristic search strategies, and two hybrid heuristic search algorithms for deadlock-free scheduling of FMSs are proposed.}}, added-at = {2017-09-08T10:52:59.000+0200}, author = {Lei, Hang and Xing, Keyi and Han, Libin and Gao, Zhenxin}, biburl = {https://www.bibsonomy.org/bibtex/2fe17a1f429cfcc56b4e59c514a0f4d3f/fernand0}, citeulike-article-id = {14312513}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.asoc.2017.01.045}, doi = {10.1016/j.asoc.2017.01.045}, interhash = {72a068a05cd57dbf1382820a2a168b38}, intrahash = {fe17a1f429cfcc56b4e59c514a0f4d3f}, issn = {15684946}, journal = {Applied Soft Computing}, keywords = {citeulike imported}, month = jun, pages = {413--423}, posted-at = {2017-03-16 17:29:30}, priority = {2}, timestamp = {2017-09-08T10:53:23.000+0200}, title = {{Hybrid heuristic search approach for deadlock-free scheduling of flexible manufacturing systems using Petri nets}}, url = {http://dx.doi.org/10.1016/j.asoc.2017.01.045}, volume = 55, year = 2017 }