Hierarchical scheduling of mobile robots in production-transportation supply chains

Eugene Levner, Leonid Meyzin, Frank Werner

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

5 Scopus citations


In this paper we propose a decomposition approach that hierarchically integrates the batching and local search heuristics in manufacturing scheduling. The problem comprises two main interrelated stages embedded in any production-transportation supply chain, namely (i) scheduling processing of raw materials and robot's transportation operation within each individual cell, and (ii) scheduling of transportation and distribution of batches of semi-finished products between cells. Several efficient heuristic algorithms are proposed. This work has been motivated by a real-life problem of production planning for a CIM system for manufacturing of multi-component products served by robots.

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

Publication series

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


  • Efficient algorithms
  • Graph-theoretic models
  • Local search
  • Periodic movement
  • Polynomial models
  • Robot
  • Scheduling
  • Sieve algorithm


Dive into the research topics of 'Hierarchical scheduling of mobile robots in production-transportation supply chains'. Together they form a unique fingerprint.

Cite this