Procedures for the Time and Space constrained Assembly Line Balancing Problem

Joaquín Bautista; Jordi Pereira

doi:10.1016/j.ejor.2011.01.052

Procedures for the Time and Space constrained Assembly Line Balancing Problem

Joaquín Bautista, Jordi Pereira

Research output: Contribution to journal › Article › peer-review

29 Scopus citations

Abstract

The Time and Space constrained Assembly Line Balancing Problem (TSALBP) is a variant of the classical Simple Assembly Line Balancing Problem that additionally accounts for the space requirements of machinery and assembled parts. The present work proposes an adaptation of the Bounded Dynamic Programming (BDP) method to solve the TSALBP variant with fixed cycle time and area availability. Additionally, different lower bounds for the simple case are extended to support the BDP method as well as to assess the quality of the obtained solutions. Our results indicate that the proposed bounds and solution procedures outperform any other previous approach found in the literature.

Original language	English
Pages (from-to)	473-481
Number of pages	9
Journal	European Journal of Operational Research
Volume	212
Issue number	3
DOIs	https://doi.org/10.1016/j.ejor.2011.01.052
State	Published - 1 Aug 2011
Externally published	Yes

Keywords

Assembly Line Balancing
Bounded Dynamic Programming
Column generation
Lower bounds
Manufacturing

Access to Document

10.1016/j.ejor.2011.01.052

Cite this

@article{bfa4fdacb33546fd9d0cdab72a569e43,

title = "Procedures for the Time and Space constrained Assembly Line Balancing Problem",

abstract = "The Time and Space constrained Assembly Line Balancing Problem (TSALBP) is a variant of the classical Simple Assembly Line Balancing Problem that additionally accounts for the space requirements of machinery and assembled parts. The present work proposes an adaptation of the Bounded Dynamic Programming (BDP) method to solve the TSALBP variant with fixed cycle time and area availability. Additionally, different lower bounds for the simple case are extended to support the BDP method as well as to assess the quality of the obtained solutions. Our results indicate that the proposed bounds and solution procedures outperform any other previous approach found in the literature.",

keywords = "Assembly Line Balancing, Bounded Dynamic Programming, Column generation, Lower bounds, Manufacturing",

author = "Joaqu{\'i}n Bautista and Jordi Pereira",

note = "Funding Information: The authors greatly appreciate the collaboration of Nissan Spanish Industrial Operations as well as the Nissan Chair UPC for partially funding this research. This work was also partially funded by project DPI2007-63026 (PROTHIUS-II) and DPI2010-16759 (PROTHIUS-III) from the Spanish Government , both including EDRF fundings.",

year = "2011",

month = aug,

day = "1",

doi = "10.1016/j.ejor.2011.01.052",

language = "English",

volume = "212",

pages = "473--481",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Procedures for the Time and Space constrained Assembly Line Balancing Problem

AU - Bautista, Joaquín

AU - Pereira, Jordi

N1 - Funding Information: The authors greatly appreciate the collaboration of Nissan Spanish Industrial Operations as well as the Nissan Chair UPC for partially funding this research. This work was also partially funded by project DPI2007-63026 (PROTHIUS-II) and DPI2010-16759 (PROTHIUS-III) from the Spanish Government , both including EDRF fundings.

PY - 2011/8/1

Y1 - 2011/8/1

N2 - The Time and Space constrained Assembly Line Balancing Problem (TSALBP) is a variant of the classical Simple Assembly Line Balancing Problem that additionally accounts for the space requirements of machinery and assembled parts. The present work proposes an adaptation of the Bounded Dynamic Programming (BDP) method to solve the TSALBP variant with fixed cycle time and area availability. Additionally, different lower bounds for the simple case are extended to support the BDP method as well as to assess the quality of the obtained solutions. Our results indicate that the proposed bounds and solution procedures outperform any other previous approach found in the literature.

AB - The Time and Space constrained Assembly Line Balancing Problem (TSALBP) is a variant of the classical Simple Assembly Line Balancing Problem that additionally accounts for the space requirements of machinery and assembled parts. The present work proposes an adaptation of the Bounded Dynamic Programming (BDP) method to solve the TSALBP variant with fixed cycle time and area availability. Additionally, different lower bounds for the simple case are extended to support the BDP method as well as to assess the quality of the obtained solutions. Our results indicate that the proposed bounds and solution procedures outperform any other previous approach found in the literature.

KW - Assembly Line Balancing

KW - Bounded Dynamic Programming

KW - Column generation

KW - Lower bounds

KW - Manufacturing

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

U2 - 10.1016/j.ejor.2011.01.052

DO - 10.1016/j.ejor.2011.01.052

M3 - Article

AN - SCOPUS:79954579266

SN - 0377-2217

VL - 212

SP - 473

EP - 481

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

Procedures for the Time and Space constrained Assembly Line Balancing Problem

Abstract

Keywords

Access to Document

Fingerprint

Cite this