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

In this paper, we consider the problem of scheduling tasks on two dedicated processors where some tasks need to be processed only by the first processor and some others by the second processor; the remaining tasks, however, need both processors simultaneously. Tasks have release dates and have...