A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study. Issue 3 (1st February 2016)

• Record Type: Journal Article
• Authors: Polat, Olcay; Kalayci, Can B.; Mutlu, Özcan; Gupta, Surendra M.
• Is Part Of: International journal of production research. Volume 54:Issue 3(2016)
• Page Start: 722
• Page End: 741
• Publication Date: 2016-02-01
• Subjects: assembly line balancing -- worker assignment -- variable neighbourhood search; Factory management -- Periodicals; 658.57
• DOI: 10.1080/00207543.2015.1055344
• Languages: English
• ISSNs: 0020-7543

Abstract

Abstract : The assembly line worker assignment and balancing problem type-II (ALWABP-2) occurs when workers and tasks (where task times depend on workers' skills) are to be simultaneously assigned to a fixed number of workstations with the goal of minimising the cycle time. In this study, a two-phase variable neighbourhood search (VNS) algorithm is proposed to solve the ALWABP-2 due to the NP-hard nature of this problem. In the first phase of the algorithm, a VNS approach is applied to assign tasks to workstations with the aim of minimising the cycle time while in the second phase, a variable neighbourhood descent method is applied to assign workers to workstations. The performance of the proposed algorithm is tested on well-known benchmark instances. In addition, the proposed algorithm has been used to solve a real case study from a consumer electronics company that manufactures LCD TVs. The results show that the algorithm is superior to the methods reported in the literature in terms of its higher efficiency and robustness. Furthermore, the algorithm is easy to implement and significantly improves the performance of the final assembly line for the investigated LCD TV real case study.