Robotic cell scheduling with operational flexibility

M. Selim Akturk*, Hakan Gultekin, Oya Ekin Karasan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

35 Citations (Scopus)


In this paper, we study the problem of two-machine, identical parts robotic cell scheduling with operational flexibility. We assume that every part to be processed has a number of operations to be completed in these two machines and both machines are capable of performing all of the operations. The decision to be made includes finding the optimal robot move cycle and the corresponding optimal allocation of operations to these two machines that jointly minimize the cycle time. We prove that with this definition of the problem 1-unit robot move cycles are no longer necessarily optimal and that according to the given parameters either one of the 1-unit robot move cycles or a 2-unit robot move cycle is optimal. The regions of optimality are presented.

Original languageEnglish
Pages (from-to)334-348
Number of pages15
JournalDiscrete Applied Mathematics
Issue number3
Publication statusPublished - Jan 30 2005
Externally publishedYes


  • Automated manufacturing
  • Cyclic scheduling
  • Robotic cell

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Robotic cell scheduling with operational flexibility'. Together they form a unique fingerprint.

Cite this