We solve the type-2 assembly line balancing problem in the presence of sequence-dependent setup times, denoted SUALBP-2. The problem consists of a set of tasks of a product, requiring to be processed in different assembly stations. Each task has a definite processing and setup times. The magnitude of setup times for each task is dependent on the processing sequence within each station. Processing and setup times of tasks assigned to each station constitute the station time. The goal is to minimize the cycle time (the maximum station time) by optimally (i) assigning tasks to assembly stations and (ii) sequencing these tasks within each station. To solve this challenging optimization problem, we first improve upon an existing mixed-integer programming (MIP) model by our proposed lower and upper bounds. These enhancements reduce the MIP model’s (solved CPLEX) average optimality gap from 41.61% to 20.77% on extra-large instances of the problem. To further overcome the intractability of the MIP model, we develop an exact logic-based Benders decomposition (LBBD) algorithm. The LBBD algorithm effectively incorporates a novel two-phase solution approach, the lower and upper bounds, various preprocessing techniques, relaxations, and valid inequalities. Using existing benchmarks in the literature, we demonstrate that our LBBD algorithm finds integer feasible solutions for 100% of all 788 instances (64% for the MIP), verifies optimality for 47% of instances (37% for the MIP), and achieves an average optimality gap of 5.04% (7.72% for the MIP obtained over 64% solved small instances). The LBBD algorithm also significantly reduces the computational time required to solve these benchmarks. Summary of Contribution: Assembly line balancing plays a crucial role in productivity enhancement in manufacturing and service companies. A balanced assembly line ensures higher throughput rate and fairer distribution of workload among assembly stations (workers). Assembly line balancing, in its simplest form, is one of the most challenging combinatorial optimization problems. Its complexity is further intensified when the sequence of executing tasks assigned to each station influences the magnitude of the setup performed between any two successive tasks. In view of such complexity, most assembly line balancing problems have been solved by randomized search techniques that do not provide any guarantee on the quality of solutions found. The mission of this paper is to understand whether there is any special structure within the existing mathematical models in the literature and, if so, exploit them toward developing computationally efficient exact techniques that can provide guarantee on the quality of solutions. Indeed, we demonstrate that such a special mathematical structure exists and we thus develop the first decomposition technique in form of a logic-based Benders decomposition (LBBD) to efficiently solve the type-2 sequence-dependent assembly line balancing problem. Specifically, we show that our LBBD significantly reduces cycle time and the time required for decision making. Our LBBD generalizes the scope of exact techniques for decision-making beyond the assembly line problems and is extendable to many other shop scheduling problems that arrange their stations (machines) serially and there are sequence-dependent setup times among their tasks.
Assembly Line Balancing Problem with Stochastic Sequence-Dependent Setup Times
