V. Deineko and G. Steiner, “Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices,” Journal of Combinatorial Optimization, Vol. 9, No. 4, 2005, pp. 381-399. doi:10.1007/s10878-005-1778-8

has been cited by the following article:

• TITLE: A Petri Net Model for Part Sequencing and Robot Moves Sequence in A 2-Machine Robotic Cell

  AUTHORS: Mohammad Fathian, Isa Nakhai Kamalabadi, Mehdi Heydari, Hiwa Farughi

  KEYWORDS: Cycle Time, 2-Machine Robotic Cell, Petri Networks, Part Sequencing, Robot Moves Sequence

  JOURNAL NAME: Journal of Software Engineering and Applications, Vol.4 No.11, November 21, 2011

  ABSTRACT: This paper deals with part sequencing and optimal robot moves sequence in 2-machine robotic cells according to Petri net graph. We have assumed that the robotic cell is capable of producing same and different parts. We have considered a new motion cycle for robot moves sequence which is the development of existing motion cycles in 2-machine robotic cells. The main goal of this study is to minimize the cycle time by determining the optimal part sequencing and robot moves sequence in the robotic cell. So, we have proposed a model based on Petri network.