A discrete differential evolution algorithm for cyclic scheduling problem in re-entrant robotic cells

Shibohua Zhang, Pengyu Yan, Ada Che

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

5 Scopus citations

Abstract

This paper addresses cyclic scheduling in robotic cells with re-entrant workstations which parts visit more than once. We present an analytical model for the problem with a given robot move sequence. Then the problem is transferred to find a robot move sequence to minimize the cycle time. An efficient discrete differential evolution (DDE) algorithm is presented to search a near-optimal robot move sequence. We encode the permutation of the robot moves as the chromosome of the individual and propose a modified mutation and crossover operations to generate the new individual. Our DDE algorithm is tested by a numerical instance.

Original languageEnglish
Title of host publication2013 10th International Conference on Service Systems and Service Management - Proceedings of ICSSSM 2013
Pages273-277
Number of pages5
DOIs
StatePublished - 2013
Event2013 10th International Conference on Service Systems and Service Management, ICSSSM 2013 - Hong Kong, China
Duration: 17 Jul 201319 Jul 2013

Publication series

Name2013 10th International Conference on Service Systems and Service Management - Proceedings of ICSSSM 2013

Conference

Conference2013 10th International Conference on Service Systems and Service Management, ICSSSM 2013
Country/TerritoryChina
CityHong Kong
Period17/07/1319/07/13

Keywords

  • cyclic scheduling
  • discrete differential evolution
  • re-entrant
  • robotic cell

Fingerprint

Dive into the research topics of 'A discrete differential evolution algorithm for cyclic scheduling problem in re-entrant robotic cells'. Together they form a unique fingerprint.

Cite this