Lei, Lei; Wang, Tzyh-Jong - In: Management Science 37 (1991) 12, pp. 1629-1639
The problem of cyclic scheduling of two hoists is defined as follows. There are N + 1 workstations, S<sub>0</sub>, S<sub>1</sub>, ..., S<sub>N</sub>, and two identical hoists that move jobs between stations. Jobs are identical and each job has to visit all stations in the order that stations are numbered. It is assumed that the...
