Procedures for the Time and Space constrained Assembly Line Balancing Problem

Joaquín Bautista and Jordi Pereira

European Journal of Operational Research, 2011, vol. 212, issue 3, 473-481

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: Manufacturing; Assembly; Line; Balancing; Lower; bounds; Column; generation; Bounded; Dynamic; Programming (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(11)00106-8
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:212:y:2011:i:3:p:473-481

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().