ASSEMBLY LINE BALANCING PROBLEM WITH HIERARCHICAL WORKER ASSIGNMENT, POSITIONAL CONSTRAINTS, TASK ASSIGNMENT RESTRICTIONS AND PARALLEL WORKSTATIONS

Authors

  • Seyda Topaloglu Yildiz Dokuz Eylul University Department of Industrial Engineering http://orcid.org/0000-0001-6827-126X
  • Gokalp Yildiz Dokuz Eylul University Department of Industrial Engineering
  • Raziye Okyay

DOI:

https://doi.org/10.23055/ijietap.2020.27.3.5953

Keywords:

industrial engineering, production, heuristics, operations research

Abstract

In this paper, we consider the assembly line balancing problem with hierarchical worker assignment, positional constraints, station paralleling options, and task assignment restrictions. The objective of this problem is to decide on the number of parallel stations to be opened in each work stage and to assign tasks and workers to stations such that the sum of station opening costs and worker costs is minimized. To solve this problem, we initially propose an integer programming model and then develop a simulated annealing algorithm with a local search procedure. A set of test problems are solved using both the proposed IP model, hybrid simulated annealing and original simulated annealing algorithms. The computational results show the effectiveness and efficiency of the proposed hybrid simulated annealing algorithm.

Author Biographies

Seyda Topaloglu Yildiz, Dokuz Eylul University Department of Industrial Engineering

Industrial Engineering Professor

Gokalp Yildiz, Dokuz Eylul University Department of Industrial Engineering

Inustrial Engineering and Associate Professor

Published

2020-12-19

How to Cite

Topaloglu Yildiz, S., Yildiz, G., & Okyay, R. (2020). ASSEMBLY LINE BALANCING PROBLEM WITH HIERARCHICAL WORKER ASSIGNMENT, POSITIONAL CONSTRAINTS, TASK ASSIGNMENT RESTRICTIONS AND PARALLEL WORKSTATIONS. International Journal of Industrial Engineering: Theory, Applications and Practice, 27(3). https://doi.org/10.23055/ijietap.2020.27.3.5953

Issue

Section

Production Planning and Control