An algorithm for hoist scheduling problems

This paper proposes an algorithm for hoist scheduling problems in a flexible PCB electroplating line where there is no buffer among workstations. Due to its chemical process nature, the processing times have to be controlled within a specified range (i.e. between a maximum processing time and a minimum processing time). The product will become defective if this constant is violated. The objective is to maximize throughput with no defective product. The proposed algorithm schedules jobs entering the system based on the specified range of processing time. A simulation study shows that the proposed algorithm outperforms the basic algorithm that schedules jobs based on the minimum processing times.