The Experts below are selected from a list of 1686 Experts worldwide ranked by ideXlab platform
Surendra M Gupta - One of the best experts on this subject based on the ideXlab platform.
-
a two phase variable neighbourhood search algorithm for Assembly Line Worker assignment and balancing problem type ii an industrial case study
International Journal of Production Research, 2016Co-Authors: Olcay Polat, Ozcan Mutlu, Can Berk Kalayci, Surendra M GuptaAbstract: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 r...
-
a two phase variable neighbourhood search algorithm for Assembly Line Worker assignment and balancing problem type ii an industrial case study
International Journal of Production Research, 2016Co-Authors: Olcay Polat, Ozcan Mutlu, Can Berk Kalayci, Surendra M GuptaAbstract: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.
Olcay Polat - One of the best experts on this subject based on the ideXlab platform.
-
a two phase variable neighbourhood search algorithm for Assembly Line Worker assignment and balancing problem type ii an industrial case study
International Journal of Production Research, 2016Co-Authors: Olcay Polat, Ozcan Mutlu, Can Berk Kalayci, Surendra M GuptaAbstract: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.
-
a two phase variable neighbourhood search algorithm for Assembly Line Worker assignment and balancing problem type ii an industrial case study
International Journal of Production Research, 2016Co-Authors: Olcay Polat, Ozcan Mutlu, Can Berk Kalayci, Surendra M GuptaAbstract: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 r...
-
an iterative genetic algorithm for the Assembly Line Worker assignment and balancing problem of type ii
Computers & Operations Research, 2013Co-Authors: Ozcan Mutlu, Olcay Polat, Aliye Ayca SupcillerAbstract:In this study, we consider the Assembly Line Worker assignment and balancing problem of type-II (ALWABP-2). ALWABP-2 arises when task times differ depending on operator skills and concerns with the assignment of tasks and operators to stations in order to minimize the cycle time. We developed an iterative genetic algorithm (IGA) to solve this problem. In the IGA, three search approaches are adopted in order to obtain search diversity and efficiency: modified bisection search, genetic algorithm and iterated local search. When designing the IGA, all the parameters such as construction heuristics, genetic operators and local search operators are adapted specifically to the ALWABP-2. The performance of the proposed IGA is compared with heuristic and metaheuristic approaches on benchmark problem instances. Experimental results show that the proposed IGA is very effective and robust for a large set of benchmark problems.
Ozcan Mutlu - One of the best experts on this subject based on the ideXlab platform.
-
a two phase variable neighbourhood search algorithm for Assembly Line Worker assignment and balancing problem type ii an industrial case study
International Journal of Production Research, 2016Co-Authors: Olcay Polat, Ozcan Mutlu, Can Berk Kalayci, Surendra M GuptaAbstract: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.
-
a two phase variable neighbourhood search algorithm for Assembly Line Worker assignment and balancing problem type ii an industrial case study
International Journal of Production Research, 2016Co-Authors: Olcay Polat, Ozcan Mutlu, Can Berk Kalayci, Surendra M GuptaAbstract: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 r...
-
an iterative genetic algorithm for the Assembly Line Worker assignment and balancing problem of type ii
Computers & Operations Research, 2013Co-Authors: Ozcan Mutlu, Olcay Polat, Aliye Ayca SupcillerAbstract:In this study, we consider the Assembly Line Worker assignment and balancing problem of type-II (ALWABP-2). ALWABP-2 arises when task times differ depending on operator skills and concerns with the assignment of tasks and operators to stations in order to minimize the cycle time. We developed an iterative genetic algorithm (IGA) to solve this problem. In the IGA, three search approaches are adopted in order to obtain search diversity and efficiency: modified bisection search, genetic algorithm and iterated local search. When designing the IGA, all the parameters such as construction heuristics, genetic operators and local search operators are adapted specifically to the ALWABP-2. The performance of the proposed IGA is compared with heuristic and metaheuristic approaches on benchmark problem instances. Experimental results show that the proposed IGA is very effective and robust for a large set of benchmark problems.
Can Berk Kalayci - One of the best experts on this subject based on the ideXlab platform.
-
a two phase variable neighbourhood search algorithm for Assembly Line Worker assignment and balancing problem type ii an industrial case study
International Journal of Production Research, 2016Co-Authors: Olcay Polat, Ozcan Mutlu, Can Berk Kalayci, Surendra M GuptaAbstract: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 r...
-
a two phase variable neighbourhood search algorithm for Assembly Line Worker assignment and balancing problem type ii an industrial case study
International Journal of Production Research, 2016Co-Authors: Olcay Polat, Ozcan Mutlu, Can Berk Kalayci, Surendra M GuptaAbstract: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.
-
study
'Informa UK Limited', 2016Co-Authors: Polat O, Can Berk Kalayci, Mutlu O, Sm GuptaAbstract: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
Cristóbal Miralles - One of the best experts on this subject based on the ideXlab platform.
-
balancing parallel Assembly Lines with disabled Workers
European Journal of Industrial Engineering, 2015Co-Authors: Felipe F B Araujo, Alysson M. Costa, Cristóbal MirallesAbstract:In this paper, we study an Assembly Line balancing problem that occurs in sheltered Worker centres for the disabled, where Workers with very different characteristics are present. We are interested in the situation in which complete parallel Assembly Lines are allowed and name the resulting problem as parallel Assembly Line Worker assignment and balancing problem (PALWABP). This approach enables many new possible Worker-tasks assignments, what is beneficial in terms of both labour integration and productivity. We present a Linear mixed-integer formulation and two heuristic solution methods: one is based on tabu search and the other is a biased random-key genetic algorithm (BRKGA). Computational results with a large set of instances recently proposed in the literature show the advantages of allowing such alternative Line layouts. [Received 6 November 2013; Revised 14 February 2014; Accepted 26 March 2014]
-
model and heuristics for the Assembly Line Worker integration and balancing problem
Computers & Operations Research, 2015Co-Authors: Mayron César O. Moreira, Cristóbal Miralles, Alysson M. CostaAbstract:We propose the Assembly Line Worker Integration and Balancing Problem (ALWIBP), a new Assembly Line balancing problem arising in Lines with conventional and disabled Workers. The goal of this problem is to maintain high productivity levels by minimizing the number of workstations needed to reach a given output, while integrating in the Assembly Line a number of disabled Workers. Being able to efficiently manage a heterogeneous workforce is especially important in the current social context where companies are urged to integrate Workers with different profiles. In this paper we present mathematical models and heuristic methodologies that can help Assembly Line managers to cope with this additional complexity. We demonstrate by means of a robust benchmark how this integration can be done with losses of productivity that are much lower than expected.
-
balancing parallel Assembly Lines with disabled Workers
arXiv: Discrete Mathematics, 2013Co-Authors: Felipe F B Araujo, Alysson M. Costa, Cristóbal MirallesAbstract:We study an Assembly Line balancing problem that occurs in sheltered Worker centers for the disabled, where Workers with very different characteristics are present. We are interested in the situation in which parallel Assembly Lines are allowed and name the resulting problem as parallel Assembly Line Worker assignment and balancing problem. We present a Linear mixed-integer formulation and a four-stage heuristic algorithm. Computational results with a large set of instances recently proposed in the literature show the advantages of allowing alternative Line layouts.
-
on solving the Assembly Line Worker assignment and balancing problem via beam search
Computers & Operations Research, 2011Co-Authors: Christian Blum, Cristóbal MirallesAbstract:Certain types of manufacturing processes can be modelled by Assembly Line balancing problems. In this work we deal with a specific Assembly Line balancing problem that is known as the Assembly Line Worker assignment and balancing problem (ALWABP). This problem appears in settings where tasks must be assigned to Workers, and Workers to work stations. Task processing times are Worker specific, and Workers might even be incompatible with certain tasks. The ALWABP was introduced to model Assembly Lines typical for sheltered work centers for the Disabled. In this paper we introduce an algorithm based on beam search for solving the ALWABP with the objective of minimizing the cycle time when given a fixed number of work stations, respectively, Workers. This problem version is denoted as ALWABP-2. The experimental results show that our algorithm is currently a state-of-the-art method for the ALWABP-2. In comparison to results from the literature, our algorithm obtains better or equal results in all cases. Moreover, the algorithm is very robust for what concerns the application to problem instances of different characteristics.
-
Job rotation in Assembly Lines employing disabled Workers
International Journal of Production Economics, 2009Co-Authors: Alysson M. Costa, Cristóbal MirallesAbstract:Abstract In this paper we consider the programming of job rotation in the Assembly Line Worker assignment and balancing problem. The motivation for this study comes from the designing of Assembly Lines in sheltered work centers for the disabled, where Workers have different task execution times. In this context, the well-known training aspects associated with job rotation are particularly desired. We propose a metric along with a mixed integer Linear model and a heuristic decomposition method to solve this new job rotation problem. Computational results show the efficacy of the proposed heuristics.
