Skip to main navigation Skip to search Skip to main content

An algorithm for optimal cyclic scheduling in a robotic cell with flexible processing times

  • Pengyu Yan
  • , Chengbin Chu
  • , Ada Che
  • , Naiding Yang
  • Northwestern Polytechnical University Xian
  • Université de technologie de Troyes

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

10 Scopus citations

Abstract

This paper describes an exact algorithm for the optimal cyclic scheduling in a robotic cell with flexible processing times and a material handling robot. The problem is formulated with the prohibited intervals of the cycle time based on the capacity constraints of the machines and the robot. After the analysis of the developed mathematic model, the problem is transformed to enumerate the non-prohibited intervals for the cycle time. An efficient branch and bound algorithm is proposed to complete this enumeration procedure. Computational results on randomly generated test instances indicate that the algorithm is effective.

Original languageEnglish
Title of host publication2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008
Pages153-157
Number of pages5
DOIs
StatePublished - 2008
Event2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008 - Singapore, Singapore
Duration: 8 Dec 200811 Dec 2008

Publication series

Name2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008

Conference

Conference2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008
Country/TerritorySingapore
CitySingapore
Period8/12/0811/12/08

Keywords

  • Branch and bound algorithm
  • Cyclic scheduling
  • Flexible processing times
  • Robotic cell

Fingerprint

Dive into the research topics of 'An algorithm for optimal cyclic scheduling in a robotic cell with flexible processing times'. Together they form a unique fingerprint.

Cite this