Robotic cell cyclic scheduling considering cell layout

Jianguang Feng, Ada Che

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

1 Scopus citations

Abstract

This paper studies a robotic cell cyclic scheduling problem where the transportation between machines is executed by a robot. The objective is to maximize the throughput and minimize the total robot travel distance simultaneously. The two objectives are both affected not only by the robot schedule, but also by the cell layout because the distance between any pair of machines varies with different cell layouts. A bi-objective mixed integer programming (MIP) model is developed to optimize the above two objectives by simultaneously optimizing cell layout and its corresponding robot schedule. A case study demonstrates the efficiency of the proposed approach.

Original languageEnglish
Title of host publicationProceedings of the 32nd Chinese Control Conference, CCC 2013
PublisherIEEE Computer Society
Pages2622-2626
Number of pages5
ISBN (Print)9789881563835
StatePublished - 18 Oct 2013
Event32nd Chinese Control Conference, CCC 2013 - Xi'an, China
Duration: 26 Jul 201328 Jul 2013

Publication series

NameChinese Control Conference, CCC
ISSN (Print)1934-1768
ISSN (Electronic)2161-2927

Conference

Conference32nd Chinese Control Conference, CCC 2013
Country/TerritoryChina
CityXi'an
Period26/07/1328/07/13

Keywords

  • cell layout
  • Cyclic scheduling
  • mixed integer programming (MIP)
  • robotic cell

Fingerprint

Dive into the research topics of 'Robotic cell cyclic scheduling considering cell layout'. Together they form a unique fingerprint.

Cite this