A polynomial algorithm for 2-cyclic robotic scheduling

Vladimir Kats, Eugene Levner

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

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).

Original languageEnglish
Title of host publicationMICAI 2006
Subtitle of host publicationAdvances in Artificial Intelligence - 5th Mexican International Conference on Artificial Intelligence, Proceedings
PublisherSpringer Verlag
Pages439-449
Number of pages11
ISBN (Print)3540490264, 9783540490265
DOIs
StatePublished - 2006
Externally publishedYes
Event5th Mexican International Conference on Artificial Intelligence, MICAI 2006: Advances in Artificial Intelligence - Apizaco, Mexico
Duration: 13 Nov 200617 Nov 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4293 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th Mexican International Conference on Artificial Intelligence, MICAI 2006: Advances in Artificial Intelligence
Country/TerritoryMexico
CityApizaco
Period13/11/0617/11/06

Fingerprint

Dive into the research topics of 'A polynomial algorithm for 2-cyclic robotic scheduling'. Together they form a unique fingerprint.

Cite this