Scheduling a two-machine robotic cell: A solvable case

Eugene Levner, Konstantin Kogan, Ilya Levin

Research output: Contribution to journalArticlepeer-review


The paper deals with the scheduling of a robotic cell in which jobs are processed on two tandem machines. The job transportation between the machines is done by a transportation robot. The robotic cell has limitations on the intermediate space between the machines for storing the work-in-process. What complicates the scheduling problem is that the loading/unloading operation times are non-negligible. Given the total number of operations n, an optimal O(n log n)-time algorithm is proposed together with the proof of optimality.

Original languageEnglish
Pages (from-to)217-232
Number of pages16
JournalAnnals of Operations Research
Issue number1
StatePublished - Dec 1995


  • Scheduling
  • optimization
  • robotic cell
  • tandem machines


Dive into the research topics of 'Scheduling a two-machine robotic cell: A solvable case'. Together they form a unique fingerprint.

Cite this