Enhancing the Largest Set Rule for Assembly Line Balancing through the concept of bi-directional work relatedness

Konstantinos N. Genikomsakis, Vassilios D. Tourassis

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

The process of optimally assigning the timed tasks required to assemble a product to an ordered sequence of workstations is known as the Assembly Line Balancing (ALB) problem. Typical approaches to ALB assume a strict mathematical posture and mostly treat it as a combinatorial optimization problem with the objective of minimizing the idle time across the workstations, while satisfying precedence constraints. The actual nature of the tasks assigned is seldom taken into consideration. While this approach may yield satisfactory cycle time results on paper, it often leads to inconvenient task assignments in an actual work environment. It has been postulated in the literature that assigning groups of related tasks to the same workstation may lead to assembly lines that exhibit increased robustness in real-world situations at the expense of a slightly increased cycle time. The prototypical example of such an approach, Agrawal's Largest Set Rule (LSR), utilizes backward work relatedness to assign a set of cohesive tasks to the proper workstation. In this paper, we enhance the performance of the original LSR algorithm through the concept of bi-directional work relatedness, where backward and forward relationships are taken into consideration for task assignments. The proposed concept leads to comparable cycle time and improved work relatedness. Applying this novel concept to a benchmark ALB problem demonstrates the feasibility and applicability of the proposed approach.

Original languageEnglish
Pages (from-to)353-363
Number of pages11
JournalJournal of Advanced Computational Intelligence and Intelligent Informatics
Volume14
Issue number4
Publication statusPublished - May 2010
Externally publishedYes

Fingerprint

Combinatorial optimization

Keywords

  • Assembly Line Balancing
  • Work relatedness

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Vision and Pattern Recognition
  • Human-Computer Interaction

Cite this

@article{96e1161a0d86463c8ff8d8c46dbcc820,
title = "Enhancing the Largest Set Rule for Assembly Line Balancing through the concept of bi-directional work relatedness",
abstract = "The process of optimally assigning the timed tasks required to assemble a product to an ordered sequence of workstations is known as the Assembly Line Balancing (ALB) problem. Typical approaches to ALB assume a strict mathematical posture and mostly treat it as a combinatorial optimization problem with the objective of minimizing the idle time across the workstations, while satisfying precedence constraints. The actual nature of the tasks assigned is seldom taken into consideration. While this approach may yield satisfactory cycle time results on paper, it often leads to inconvenient task assignments in an actual work environment. It has been postulated in the literature that assigning groups of related tasks to the same workstation may lead to assembly lines that exhibit increased robustness in real-world situations at the expense of a slightly increased cycle time. The prototypical example of such an approach, Agrawal's Largest Set Rule (LSR), utilizes backward work relatedness to assign a set of cohesive tasks to the proper workstation. In this paper, we enhance the performance of the original LSR algorithm through the concept of bi-directional work relatedness, where backward and forward relationships are taken into consideration for task assignments. The proposed concept leads to comparable cycle time and improved work relatedness. Applying this novel concept to a benchmark ALB problem demonstrates the feasibility and applicability of the proposed approach.",
keywords = "Assembly Line Balancing, Work relatedness",
author = "Genikomsakis, {Konstantinos N.} and Tourassis, {Vassilios D.}",
year = "2010",
month = "5",
language = "English",
volume = "14",
pages = "353--363",
journal = "Journal of Advanced Computational Intelligence and Intelligent Informatics",
issn = "1343-0130",
publisher = "Fuji Technology Press",
number = "4",

}

TY - JOUR

T1 - Enhancing the Largest Set Rule for Assembly Line Balancing through the concept of bi-directional work relatedness

AU - Genikomsakis, Konstantinos N.

AU - Tourassis, Vassilios D.

PY - 2010/5

Y1 - 2010/5

N2 - The process of optimally assigning the timed tasks required to assemble a product to an ordered sequence of workstations is known as the Assembly Line Balancing (ALB) problem. Typical approaches to ALB assume a strict mathematical posture and mostly treat it as a combinatorial optimization problem with the objective of minimizing the idle time across the workstations, while satisfying precedence constraints. The actual nature of the tasks assigned is seldom taken into consideration. While this approach may yield satisfactory cycle time results on paper, it often leads to inconvenient task assignments in an actual work environment. It has been postulated in the literature that assigning groups of related tasks to the same workstation may lead to assembly lines that exhibit increased robustness in real-world situations at the expense of a slightly increased cycle time. The prototypical example of such an approach, Agrawal's Largest Set Rule (LSR), utilizes backward work relatedness to assign a set of cohesive tasks to the proper workstation. In this paper, we enhance the performance of the original LSR algorithm through the concept of bi-directional work relatedness, where backward and forward relationships are taken into consideration for task assignments. The proposed concept leads to comparable cycle time and improved work relatedness. Applying this novel concept to a benchmark ALB problem demonstrates the feasibility and applicability of the proposed approach.

AB - The process of optimally assigning the timed tasks required to assemble a product to an ordered sequence of workstations is known as the Assembly Line Balancing (ALB) problem. Typical approaches to ALB assume a strict mathematical posture and mostly treat it as a combinatorial optimization problem with the objective of minimizing the idle time across the workstations, while satisfying precedence constraints. The actual nature of the tasks assigned is seldom taken into consideration. While this approach may yield satisfactory cycle time results on paper, it often leads to inconvenient task assignments in an actual work environment. It has been postulated in the literature that assigning groups of related tasks to the same workstation may lead to assembly lines that exhibit increased robustness in real-world situations at the expense of a slightly increased cycle time. The prototypical example of such an approach, Agrawal's Largest Set Rule (LSR), utilizes backward work relatedness to assign a set of cohesive tasks to the proper workstation. In this paper, we enhance the performance of the original LSR algorithm through the concept of bi-directional work relatedness, where backward and forward relationships are taken into consideration for task assignments. The proposed concept leads to comparable cycle time and improved work relatedness. Applying this novel concept to a benchmark ALB problem demonstrates the feasibility and applicability of the proposed approach.

KW - Assembly Line Balancing

KW - Work relatedness

UR - http://www.scopus.com/inward/record.url?scp=77952725694&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77952725694&partnerID=8YFLogxK

M3 - Article

VL - 14

SP - 353

EP - 363

JO - Journal of Advanced Computational Intelligence and Intelligent Informatics

JF - Journal of Advanced Computational Intelligence and Intelligent Informatics

SN - 1343-0130

IS - 4

ER -