Type-II transfer line balancing problem

Download

index.pdf

Date

2019

Author

Telemeci, Yasin Ersin

Metadata

Show full item record

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

Item Usage Stats

174
views

51
downloads

In this thesis, we consider Type II Transfer Line Balancing that assigns the operation to the blocks and blocks to the stations so as to maximize the production rate, i.e., to minimize the cycle time. A mixed integer programming model is developed and a branch and bound algorithm is proposed for the exact solutions. The efficiency of the branch and bound algorithm is enhanced by lower and upper bounding procedures. The computational results have revealed the satisfactory behavior of the model and branch and bound algorithm on moderate size problem instances.

Subject Keywords

Transfer lines., Keywords: Transfer Lines, Type-II Transfer Line Balancing, Mathematical Model, Branch and Bound Algorithm.

URI

http://etd.lib.metu.edu.tr/upload/12624173/index.pdf
https://hdl.handle.net/11511/44844

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Assembly line balancing with station paralleling Ege, Yunus; Azizoğlu, Meral; Özdemirel, Nur Evin (2009-11-01) We consider the NP-hard problem of assembly line balancing with station paralleling. We assume an arbitrary number of parallel workstations can be assigned to each stage. Every task requires a specified tooling/equipment, and this tooling/equipment should be available in all parallel workstations of the stage to which the task is assigned. Our objective is to find an assignment of tasks to stages so as to minimize sum of station opening and tooling/equipment costs. We propose two branch and bound algorithms...
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 minisum location problem with regional demand considering farthest Euclidean distances DİNLER, DERYA; Tural, Mustafa Kemal (2016-06-01) We consider a continuous multi-facility location-allocation problem that aims to minimize the sum of weighted farthest Euclidean distances between (closed convex) polygonal and/or circular demand regions, and facilities they are assigned to. We show that the single facility version of the problem has a straightforward second-order cone programming formulation and can therefore be efficiently solved to optimality. To solve large size instances, we adapt a multi-dimensional direct search descent algorithm to ...
Analysis of flexible pavements incorporating nonlinear resilient behavior of unbound granular layers Karagöz, Cem; Acar, Soner Osman; Department of Civil Engineering (2004) Traditionally, the resilient modulus values obtained from repeated unconfined or triaxial compression tests are used as the elastic modulus of granular layers in structural analysis of flexible pavements. Sometimes the resilient modulus of granular materials are estimated from known California bearing ratios (CBR) or stabilometer resistance (R) values by simple regression equations. On the other hand, it is well known that stress-strain relation for unbound granular materials is nonlinear and the resilient ...
Workload smoothing in assembly lines İmat, Sadullah; Azizoğlu, Meral; Department of Industrial Engineering (2014) In this thesis, we consider a simple assembly line balancing problem with fixed number of workstations and predefined cycle time. Our objective is to minimize the sum of the squared deviations of the workstation loads from the cycle time. We first present pure integer nonlinear programming model and then convert the model into mixed integer linear program. We develop several optimality properties and bounding mechanisms, and use them in our branch and bound algorithm. The results of our computational study ...

Citation Formats

Y. E. Telemeci, “Type-II transfer line balancing problem,” Thesis (M.S.) -- Graduate School of Natural and Applied Sciences. Industrial Engineering., Middle East Technical University, 2019.