A MILP MODEL FOR SINGLE HOIST CYCLIC SCHEDULING

摘要

Material handling devices such as AGVs, robots and hoists are widely used for moving parts among the workstations in today's advanced manufacturing systems. Althought PHILIPS proposed first mixed integer programming (MILP) model to solve single hoist scheduling problem, the model could not get optimal solution in some cases. To eliminate the defect, we propose a modified model by adding a slack variable and some constraints. Numerical example is shown the modified MILP model is good.