Abstract

We consider two problems of periodic scheduling of parts in a robotic production system functioning under a given repetitive robot's route. The objective is to determine the starting times and durations of processing operations so as to minimize the cycle length. We reduce the problems to finding parametric critical paths in networks with varying arc lengths. In contrast to previously known methods, which solve these cyclic scheduling problems in cubic time, the parametric network approach solves the problems in $$O(m^2 {\text{ log }}m) $$ time, m being the problem size.

Full Text
Paper version not known

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.