@inproceedings{20576abf99714d579934cc33d1124857,

title = "A polynomial algorithm for 2-cyclic robotic scheduling",

abstract = "We solve a single-robot m-machine cyclic scheduling problem arising in flexible manufacturing systems served by computer-controlled robots. The problem is to find the minimum cycle time for the so-called 2-cyclic (or {"}2-degree{"}) schedules, in which exactly two parts enter and two parts leave the production line during each cycle. An earlier known polynomial time algorithm for this problem was applicable only to the Euclidean case, where the transportation times must satisfy the {"}triangle inequality{"}. In this paper we study a general non-Euclidean case. Applying a geometrical approach, we construct a polynomial time algorithm of complexity O(m5 log m).",

author = "Vladimir Kats and Eugene Levner",

year = "2006",

doi = "10.1007/11925231_41",

language = "אנגלית",

isbn = "3540490264",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "439--449",

booktitle = "MICAI 2006",

address = "גרמניה",

note = "5th Mexican International Conference on Artificial Intelligence, MICAI 2006: Advances in Artificial Intelligence ; Conference date: 13-11-2006 Through 17-11-2006",

}