Affiliation:
1. Tecnológico Nacional de México en Celaya, Mexico
2. Centro Regional de Optimización y Desarrollo de Equipo de Celaya, Mexico
Abstract
The Hoist Scheduling Problem is combinatory, so tools such as mathematical programming need to be used to get the sequence of movements, respecting the constraints of the process by minimizing the cycle time. A sequence in which the order of movements follows the order of the process is known as the basic diagram. These schedules do not have any clearance for the hoist to make any other movements, resulting in a loss in productivity. This chapter takes the production line of a Mexican factory as a case study, analyzing the hoist's travelling speed to find sequences of movements that could improve productivity. The results of the study indicate that the cycle time has a nonlinear behavior in respect of the hoist's travelling speed and it was determined that there are travelling speeds for which sequences are obtained with enough clearance to make other movements and keep other carriers on the line. A suitable speed was estimated in the case.