This paper deals with the robust optimization for the cyclic hoist scheduling problem with processing time window constraints. The robustness of a cyclic hoist schedule is defined as its ability to remain stable in the presence of perturbations or variations of certain degree in the hoist...

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...