A space allocation algorithm for assembly line components

Yossi Bukchin, Russell D. Meller*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

20 Scopus citations

Abstract

A component stockout during the assembly process is one of the most undesirable events that can occur since the resulting line stoppage is associated with extremely high costs. In this paper we address the problem of allocating space to components along the line, subject to practical constraints. The objective is to maximize the line fill-rate; namely, the probability of no line stoppages due to a lack of components between consecutive replenishments. A model for calculating the line fill-rate is presented. This model is then incorporated into a design algorithm that determines the space allocation. A large experiment for moderate-sized and large-scale problems is performed to evaluate the algorithm performance. Our experiment indicates this performance to be excellent, producing optimal solutions on moderate-sized problems in most cases and solutions that are better than three intuitive rules for most of the large-scale problems considered.

Original languageEnglish
Pages (from-to)51-61
Number of pages11
JournalIIE Transactions (Institute of Industrial Engineers)
Volume37
Issue number1
DOIs
StatePublished - Jan 2005

Funding

FundersFunder number
Ingersoll-Rand
National Science FoundationDMII 9623605, 9996444
National Science Foundation
General Motors Corporation

    Fingerprint

    Dive into the research topics of 'A space allocation algorithm for assembly line components'. Together they form a unique fingerprint.

    Cite this