Article

Assembly line balancing: Two resource constrained cases

International Journal of Production Economics (Impact Factor: 2.08). 02/2005; 96(1):129-140. DOI: 10.1016/j.ijpe.2004.03.008
Source: RePEc

ABSTRACT In this paper, a new approach on traditional assembly line balancing problem is presented. The goal of proposed approach is to establish balance of the assembly line with minimum number of station and resources. For this purpose, 0–1 integer-programming models are developed. These models are solved using GAMS-CPLEX mathematical programming software for a numerical example.

0 Bookmarks
 · 
222 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The Lexicographic Bottleneck Assembly Line Balancing Problem (LB-ALBP) is a new assembly-line balancing problem recently defined in the literature. The LB-ALBP hierarchically minimises the workload of the most heavily loaded workstation, followed by the workload of the second most heavily loaded workstation, followed by the workload of the third most heavily loaded workstation, and so on. The original study presents two mixed-integer linear programming (MILP) models designed to solve the LB-ALBP optimally, together with three heuristic procedures based on these MILPs. In this paper, we propose and test new algorithms that combine a heuristic procedure for obtaining an initial solution and several local search procedures, which are an improvement upon the heuristic procedures published to date.
    International Journal of Production Research - INT J PROD RES. 01/2011;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The classic assembly line balancing problem (ALBP) basically consists of assigning a set of tasks to a group of workstations while maintaining the tasks' precedence relations. When the objective is to minimize the number of workstations m for a given cycle time CT , the problem is referred to as ALBP-1; if the objective is to minimize CT given m , then the problem is called ALBP-2. The only objective in ALBP-2 is to minimize CT , i.e., the workload of the most heavily loaded workstation (the bottleneck). However, considering the second-biggest, third-biggest, etc. workloads, can be important. Distributing a workload among six workstations as 10, 10, 10, 4, 3, 3, is not the same as distributing it as 10, 6, 6, 6, 6, 6. The CT value is the same, but the second distribution is beyond question more reliable and balanced. In this paper, we present and formalize a new assembly line balancing problem: the Lexicographic Bottleneck Assembly Line Balancing Problem (LB-ALBP). The LB-ALBP hierarchically minimizes the workload of the most heavily loaded workstation (CT), followed by the workload of the second most heavily loaded workstation, followed by the workload of the third most heavily loaded workstation, and so on. We present two mixed-integer linear programming (MILP) models designed to solve the LB-ALBP optimally, together with three heuristic procedures based on these MILPs.
    International Journal of Production Research 01/2011; 49(8). · 1.46 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: This work presents an approach based on the ant colony optimization technique to address the assembly line balancing problem. An improved ant colony optimization with look forward ant is proposed to solve the simple assembly line balancing problem of type 1 (SALBP-1). The proposed algorithm introduces an approach to dynamically assign the value of priority rule or heuristic information during the task selection phase by allowing the ant to look forward its direct successors during the consideration in selecting a task to be assigned into a workstation. The proposed algorithm is tested and compared with literature data sets and the result from the proposed algorithm shows competitive performance against them.
    01/2011;

Full-text

View
27 Downloads
Available from