Workload smoothing in simple assembly line balancing

Date

2018-01-01

Author

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

This paper considers a simple assembly line balancing problem with fixed number of workstations and prespecified cycle time. Our objective is to minimize the sum of the squared deviations of the workstation loads around the cycle time, hence maintain workload smoothing. We develop several optimality properties and bounding mechanisms, and use them in our branch and bound algorithm. The results of our computational study reveal that our branch and bound algorithm is capable of solving medium sized problem instances in reasonable times. (C) 2017 Published by Elsevier Ltd.

Subject Keywords

Branch and bound algorithm, Assembly lines, Workload smoothing

URI

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

Journal

COMPUTERS & OPERATIONS RESEARCH

DOI

https://doi.org/10.1016/j.cor.2017.08.006

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

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 ...
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...
Rebalancing the assembly lines: exact solution approaches Sanci, Ece; Azizoğlu, Meral (2017-01-01) In this study, we consider an assembly line rebalancing problem with disruptions caused by workstation breakdowns or shutdowns. After the disruption, we aim to find a rebalance so as to catch the trade-off between the efficiency measure of cycle time and stability measure of number of tasks assigned to different workstations in the original and new balances. Our aim is to generate all nondominated objective vectors with respect to the efficiency and stability measures. We develop two optimisation algorithms...
Assembly Line Balancing with Task Paralleling Kaplan, Özlem; Özdemirel, Nur Evin; Department of Industrial Engineering (2004) In this study, we consider single model deterministic Assembly Line Balancing problem with task paralleling. The objective is to minimize the total cost which is composed of station opening cost and task dependent equipment cost. A branch and bound algorithm that allows two-level task paralleling is proposed. A heuristic algorithm is also developed both for obtaining efficient upper bounds to branch and bound and for achieving good approximate solutions for large sized problems. Computational experiments ar...
A branch and bound method for the line balancing problem in U-shaped assembly lines with equipment requirements Ogan, Dilek; Azizoğlu, Meral (2015-07-01) 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 bou...

Citation Formats

M. Azizoğlu, “Workload smoothing in simple assembly line balancing,” COMPUTERS & OPERATIONS RESEARCH, pp. 51–57, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38647.