A faster polynomial algorithm for 2-cyclic robotic scheduling

A faster polynomial algorithm for 2-cyclic robotic scheduling

0.00 Avg rating0 Votes
Article ID: iaor20081244
Country: United Kingdom
Volume: 9
Issue: 5
Start Page Number: 453
End Page Number: 468
Publication Date: Oct 2006
Journal: Journal of Scheduling
Authors:
Abstract:

This paper addresses the 2-cyclic identical part scheduling in a no-wait robotic flowshop where exactly two parts enter and two parts leave the production line during each cycle. This problem was previously proved to be polynomially solvable in O(N8logN) time, where N is the number of tanks in the production line. This paper proposes an improved algorithm with reduced complexity O(N5logN).

Reviews

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