A branch and bound method for the line balancing problem in U-shaped assembly lines with equipment requirements

Date

2015-07-01

Author

Ogan, Dilek
Azizoğlu, Meral

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

213
views

0
downloads

In this study we consider a U-shaped assembly line balancing problem where each task uses a specified set of equipments and each type of equipment has a specified cost. Our problem is to assign the tasks together with their equipments to the workstations so as to minimize the total equipment cost. We formulate the problem as a mixed integer linear programming model that is capable of solving small sized instances. We propose a branch and bound algorithm that uses efficient precedence relations and lower bounds. We find that the algorithm is able to solve moderate sized problem instances in reasonable times. (C) 2015 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.

Subject Keywords

U-shaped assembly line, Equipment requirement, Branch and bound algorithm, REMEMBER ALGORITHM

URI

https://hdl.handle.net/11511/34614

Journal

JOURNAL OF MANUFACTURING SYSTEMS

DOI

https://doi.org/10.1016/j.jmsy.2015.02.007

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

An adaptive simulated annealing algorithm-based approach for assembly line balancing and a real-life case study Guden, H.; Meral, Fatma Sedef (2016-05-01) In this study, we address the deterministic assembly line balancing problem (ALBP) in a multiple product-models environment with multiple objectives. We have been motivated by the assembly line balancing problem of a white goods product production line that is a multi-model type line with 68 stations through which four product-models are assembled, each with approximately 400 precedence relations and 300 tasks. In the plant, to cope with the increasing demand in the medium term, the efficiency of the line i...
A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem Tozkapan, A; Kirca, O; Chung, CS (2003-02-01) In this paper, a two-stage assembly scheduling problem is considered with the objective of minimizing the total weighted flowtime. A lower bounding procedure and a dominance criterion are developed and incorporated into a branch and bound procedure. A heuristic procedure is also used to derive an initial upper bound. Computational results of the algorithm are presented.
A new formulation for the analysis of bonded elastic layers Pınarbaşı, Seval; Akyüz, Uğurhan; Department of Civil Engineering (2007) Elastic layers bonded to reinforcing sheets are widely used in many engineering applications, e.g., as elastic foundations to machinery, as seismic isolators to structures, etc. Because of its practical importance, the behavior of bonded elastic layers under some basic deformation modes (e.g., compression, bending and shear modes) has attracted the attention of many researchers. However, the analytical works available in literature involve, with the object of obtaining design formulas, many simplifying assu...
An algorithm for the capacitated vehicle routing problem with time windows Pehlivanoğlu, Osman; Meral, Fatma Sedef; Department of Industrial Engineering (2005) In this thesis the capacitated vehicle routing problem with time windows (VRPTW) is studied, where the objective is to serve a set of geographically dispersed customers with known demands and predefined time windows at the minimum cost. It is hard to find an optimal solution for the VRPTW even if the problem size is small. Therefore, many heuristic methods are developed to obtain near optimal solutions. In this study a local search algorithm is proposed for solving the VRPTW, which consist of route construc...
A performance measurement framework and solution approach for the integrated facility layout problem with uncertain demand Çelik, Melih; Efeoglu, Begun; Süral, Haldun (null; 2016-06-12) The integrated facility layout problem (IFLP) focuses on the simultaneous determination of the relative locations of multiple copies of capacitated equipment or machinery in a facility, as well as the material flow between these units. In this paper, we consider the IFLP in the existence of uncertain demand for the products of the facility. Motivated by the framework for next generation facility layouts by Benjaafar et al. (2002), we extend the approaches in the literature for distributed facility layouts t...

Citation Formats

D. Ogan and M. Azizoğlu, “A branch and bound method for the line balancing problem in U-shaped assembly lines with equipment requirements,” JOURNAL OF MANUFACTURING SYSTEMS, pp. 46–54, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/34614.