A parametric algorithm for 2-cyclic robotic scheduling with interval processing times

Vladmir Kats, Eugene Levner

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

2 Scopus citations

Abstract

Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, in which exactly two parts enter and two parts leave the production line during each production cycle. This paper treats a case of 2-cyclic robot scheduling in which the robot route is given and the operation durations are to be chosen from prescribed intervals. A strongly polynomial algorithm of complexity O(m4) is proposed.

Original languageEnglish
Title of host publicationProceedings of the 13th IFAC Symposium on Information Control Problems in Manufacturing, INCOM'09
PublisherIFAC Secretariat
Pages780-785
Number of pages6
EditionPART 1
ISBN (Print)9783902661432
DOIs
StatePublished - 2009
Externally publishedYes

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
NumberPART 1
Volume13
ISSN (Print)1474-6670

Keywords

  • Efficient algorithms
  • Graph-theoretic models
  • Periodic movement
  • Polynomial models
  • Robot
  • Scheduling

Fingerprint

Dive into the research topics of 'A parametric algorithm for 2-cyclic robotic scheduling with interval processing times'. Together they form a unique fingerprint.

Cite this