Showing 1 - 1 of 1
This paper proposes a branch-and-bound algorithm for cyclic scheduling of a robotic flowshop with multiple part types in which the processing times of parts can vary within their given time windows. The problem consists of two types of sequencing issues: part input sequencing and robot move...
Persistent link: https://www.econbiz.de/10010760060