A polynomial algorithm for 2-degree cyclic robot scheduling

A polynomial algorithm for 2-degree cyclic robot scheduling

0.00 Avg rating0 Votes
Article ID: iaor20042594
Country: Netherlands
Volume: 145
Issue: 1
Start Page Number: 31
End Page Number: 44
Publication Date: Feb 2003
Journal: European Journal of Operational Research
Authors: , ,
Keywords: optimization
Abstract:

This paper studies the 2-degree cyclic scheduling of identical parts in a no-wait robotic flow shop where exactly two parts enter and leave the production line in a cycle. The objective is to minimize the cycle time. We propose a polynomial algorithm to find an optimal 2-degree cyclic schedule of robot moves. The algorithm can be implemented in O(N8logN) where N is the number of machines in the considered robotic cell. The proposed algorithm is also extended to problems where the two parts are not identical. Computational results are presented to test and evaluate the proposed algorithm.

Reviews

Required fields are marked *. Your email address will not be published.