Assembly line balancing with station paralleling

Ege Y., AZİZOĞLU M., ÖZDEMİREL N. E.

COMPUTERS & INDUSTRIAL ENGINEERING, vol.57, no.4, pp.1218-1225, 2009 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 57 Issue: 4
  • Publication Date: 2009
  • Doi Number: 10.1016/j.cie.2009.05.014
  • Journal Name: COMPUTERS & INDUSTRIAL ENGINEERING
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.1218-1225
  • Keywords: Single model assembly line balancing, Station paralleling, Branch and bound algorithm, WORKSTATIONS, DESIGN
  • Middle East Technical University Affiliated: Yes

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. (C) 2009 Elsevier Ltd. All rights reserved.