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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.