Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1)

• We solve a new variant of the accessibility windows assembly line problem level 1.
• A mathematical model is given and optimal solutions are obtained for small instances.
• For larger instances, heuristics and simulated annealing procedures are designed.
• Computational experiments are carried out to test the quality of the procedures.

In some assembly lines, the workpieces are larger than the workstations. This implies that at a given instant the workstations have access to only a portion of the workpieces. In this context, the accessibility windows assembly line balancing problem (AWALBP) arises. In the AWALBP, the cycle is split into forward steps and stationary stages. The workpieces advance during the forward steps and the tasks are processed during the stationary stages. In each stationary stage, the workstations have access to different parts of the workpieces. This work solves the first level of AWALBP (AWALBP-L1), which consists in assigning the tasks among the workstations and stationary stages. Specifically, it is considered the AWALBP-L1 case in which the tasks can be processed in several workstations and their processing times depend on the workstation in which the tasks are processed. To solve the problem, we propose several heuristics and simulated annealing procedures. An extensive computational experiment is carried out to evaluate their performance.