OPTIMAL CYCLIC SCHEDULING OF A ROBOTIC PROCESSING LINE WITH TWO-PRODUCT AND TIME-WINDOW CONSTRAINTS

摘要

In this study, we develop effective optimization algorithms for solving the problem of cyclic scheduling of a multi-stage robotic processing line with two distinct parts and time window constraints. This problem in the literature is known as hoist schedul- ing problem. To our knowledge, most existing optimization algorithms for the hoist scheduling problem handle the case with identical parts.