A station-oriented enumerative algorithm for two-sided assembly line balancing

Hu, Xiaofeng

doi:10.1016/j.ejor.2007.01.022

Return

A station-oriented enumerative algorithm for two-sided assembly line balancing

2008-04-01

PRE

Hu, Xiaofeng *

Wu E

Jin Ye

DOI：10.1016/j.ejor.2007.01.022

Original

Original request for help

Save

Abstract

En 中文

In this paper, a station-oriented enumerative algorithm for two-sided assembly lines balancing (TALB) is proposed. First, the time transfer function is defined and combined with the precedence relation to compute the earliest and the latest start time of tasks. With the direction and cycle time constraints, a station-oriented procedure based on the start time is designed to assign tasks, starting from the left station to the rightstation of the position. Some unsuitable position assignments would be finally removed by checking the precedence constraints among the assigned tasks. The proposed algorithm is integrated with the Hoffmann heuristic to develop a system for solving TALB problems. The test is performed on the well-known benchmark set of problem instances. Experimental results demonstrate that the proposed procedure is efficient. (c) 2007 Elsevier B.V. All rights reserved.

Keywords:

manufacturing

two-sided assembly line

time transfer function

assignment

heuristics

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.