SHCSP Heuristic for a Single Hoist Scheduling Problem

A new heuristic approach, called Single Hoist Cyclic Scheduling Problem (SHCSP), is presented in this paper to minimize the cycle time of the single hoist scheduling problem. This heuristic is compared to a MIP model solved by Ilog-Cplex Solver. Simulation results show the efficiency of the SHCSP heuristic, where the optimal solution is reached for more than 54 instances from literature on a reasonable computational time (less than 1 second).