Genetic algorithm for a cyclic Hoist Scheduling Problem with time-window constraints and heterogeneous part jobs

This paper concerns the domain of Hoist Scheduling Problem (HSP) and focuses on the cyclic schedule problems. In this study we tackle the single hoist cyclic scheduling problem for heterogeneous pat jobs. We propose an approached method to find an optimum or near optimum feasible cyclic scheduling which respects the hard resource and time-window constraints. We describe a genetic algorithm approach to find a schedule which can reach the optimal cycle. An example is given to illustrate the cycle time computing procedure.