Optimal cyclic scheduling for printed circuit board production lines with multiple hoists and general processing sequence

We introduce a mixed-integer programming formulation for finding optimal cyclic schedules for printed circuit board lines with multiple hoists on a shared track, where the processing sequence may be different than the location sequence of the tanks. Computational results on some benchmark problems indicate that optimal cyclic schedules for problems of realistic size can be found in a reasonable time.