Parametric algorithms for 2‐cyclic robot scheduling with interval processing times

Parametric algorithms for 2‐cyclic robot scheduling with interval processing times

0.00 Avg rating0 Votes
Article ID: iaor20115769
Volume: 14
Issue: 3
Start Page Number: 267
End Page Number: 279
Publication Date: Jun 2011
Journal: Journal of Scheduling
Authors: ,
Keywords: cycle time management, industrial robots, production flow analysis, robots
Abstract:

Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, that is, schedules in which exactly two parts enter and two parts leave the production line during each cycle. This work treats a special case of the 2-cyclic robot scheduling problem when the robot route is given and operation durations are chosen from prescribed intervals. A strongly polynomial algorithm of time complexity O(m8logm) is proposed.

Reviews

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