U-shaped partial disassembly line balancing problem with a fixed number of workstations
In order to improve the disassembly efficiency of the U-shaped disassembly line with a fixed number of workstations and reduce the potential threat of harmful parts to operators,a U-shaped partial disassembly line balancing problem with a fixed number of workstations is proposed to meet the disassembly demand of high-value parts and harmful parts.A mathematical model is established with the optimization objectives of minimizing the cycle time,reducing the number of hazardous workstations,and balancing the workload smoothness.An improved variable neighborhood search algorithm is developed to solve the problem.The selection strategy based on the releasing position of parts is proposed to reduce the influence of the disassembly sequence of the preceding parts.A minimum deviation bisection method is proposed to reduce the number of iterations of decoding.A bottleneck squeezed local search strategy is proposed to optimize the cycle time and the workload smoothness.For the line balancing problem with a fixed number of workstations,the bottleneck squeezed strategy is proposed.Numerical experiments are carried out with different scale instances to verify the efficiency of the algorithm.Compared with other algorithms,the improved variable neighborhood search algorithm is superior to other algorithms,and can efficiently solve the U-shaped partial disassembly line balancing problem with a fixed number of workstations.
disassembly line balanceU-shaped disassembly linevariable neighborhood search algorithmfixed num-ber of workstationsbottleneck squeezed local search strategy