Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311, Tehran, Iran
Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran.
This paper addresses the Simple Assembly Line Balancing Problem of type II (SALBP-II), with Simultaneous eects of deterioration and learning in which there are sequence-independent setup times relating to each task. In many real industrial environments, although the actual task processing times are dened as a function of their starting times due to deterioration eects, workstations improve continuously as a result of repeating the same activities by worker(s) or machine(s). In this paper, a mathematical model is developed for this novel problem, attempting to minimize the cycle time for a given number of workstations. In addition to the balancing of the assembly line, the developed model presents the execution scheduling of tasks assigned to each workstation. Moreover, a hybrid meta-heuristic method is proposed to solve such an NP-hard problem. This robust and simply structured solution approach uses the tabu search within the Variable Neighbourhood Search (VNS/TS). The computational experiments and comparison with a Dierential Evolution Algorithm (DEA) re ect the high eciency of our proposed algorithm for a number of well-known instances.