Cyclic scheduling in a robotic production line

Cyclic scheduling in a robotic production line

0.00 Avg rating0 Votes
Article ID: iaor20032326
Country: United Kingdom
Volume: 5
Issue: 1
Start Page Number: 23
End Page Number: 41
Publication Date: Jan 2002
Journal: Journal of Scheduling
Authors: ,
Keywords: production
Abstract:

The solution of cyclic scheduling problems is part of the classical repertoire on scheduling algorithms. We consider a problem of cyclic scheduling of identical parts in a production line where transportation of the parts between machines is performed by several robots. The problem is to find co-ordinated movements of the parts and robots in the line with the no-wait constraints imported; the objective is to maximize the throughput rate. Unlike many previous algorithms which are either heuristic or at best solve the single-robot version of the problem in O(m4 log m) time, the proposed algorithm provides an exact solution for the more complicated case of multiple robots and solves the problem in O(m3 log m) time, where m denotes the number of machines in the line.

Reviews

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