Assembly line balancing with station paralleling

Authors:
Yunus Ege;Meral Azizoglu;Nur E. Ozdemirel
Affiliations:
Industrial Engineering Department, Middle East Technical University, 06531 Ankara, Turkey;Industrial Engineering Department, Middle East Technical University, 06531 Ankara, Turkey;Industrial Engineering Department, Middle East Technical University, 06531 Ankara, Turkey
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 1
Cited 5

A survey of exact algorithms for the simple assembly line balancing problem

Management Science

Multi-objective optimization of a stochastic assembly line balancing: A hybrid simulated annealing algorithm

Computers and Industrial Engineering
A solution procedure for type E simple assembly line balancing problem

Computers and Industrial Engineering
Enhanced mixed integer programming model for a transfer line design problem

Computers and Industrial Engineering
Assembly line balancing with positional constraints, task assignment restrictions and station paralleling: A case in an electronics company

Computers and Industrial Engineering
Multi-objective optimization of stochastic disassembly line balancing with station paralleling

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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: one for optimal solutions and one for near optimal solutions. We find that optimal solutions can be found quickly for medium sized problem instances; for larger sized problems we find high quality solutions in reasonable solution times.