A Greedy Randomized Adaptive Search for Solving Chance-Constrained U-Shaped Assembly Line Balancing Problem

2. Literature Review

This section shows some information about the previous work in the U-shaped assembly line balancing problem. The problem was first presented by Miltenburg and Wijngaard (1994), where they developed a dynamic programming approach based on a heuristic to solve the problem. Ajenblit and Wainwright (1998) developed a genetic algorithm to minimize the number of stations. Nakade and Ohno (1999) solved the problem by using a heuristic approach. Their paper handled multi objectives, where they minimized the cycle time and the number of assigned workers. Erel et al. (2001) developed a simulated annealing approach to minimize the number of stations of the problem. Gökçen et al. (2005) solved the problem by using the shortest route approach, where they sought to minimize the number of stations. Gökçen and Aǧpak (2006) used a multi-criteria decision-making approach for achieving several conflicting goals.