Show simple item record

dc.contributor.authorCapacho Betancourt, Liliana
dc.contributor.authorPastor Moreno, Rafael
dc.contributor.otherUniversitat Politècnica de Catalunya. Institut d'Organització i Control de Sistemes Industrials
dc.date.accessioned2006-07-05T12:48:24Z
dc.date.available2006-07-05T12:48:24Z
dc.date.issued2005-01
dc.identifier.urihttp://hdl.handle.net/2117/418
dc.description.abstractThe classic assembly line balancing problem basically consist in assigning a set of tasks to a group of workstations while maintaining the task’ precedence relations. Habitually, such relations are represented by a predetermined precedence graph. However, a product’s assembly process may admit, for one or more of its parts, alternative precedence subgraph. This may be due to the fact that the processing time for some task are dependent on their processing sequence, or because there are alternatives for such a subassembly. In general, because of the great difficulty of the problem and the impossibility of representing alternative subgraphs in a precedence graph, the system designer will decide to select, a priori, one of such alternative subgraphs, which sometimes imposes additional constrains other than technological ones. In this paper we present, characterize and formulate a new general assembly line balancing problem: the Alternative Subgraphs Assembly Line Balancing Problem (ASALBP). Its novel characteristic is that it considers the possibility of having alternative assembly subgraphs, in which the processing times and/or the precedence relations of certain task are dependent on the assembly subgraph selected. Therefore, solving this problem implies simultaneously selecting an assembly subgraph for each part of the assembly that allows alternatives and balancing the line (i.e., assigning the task to the workstations). The potentially positive effects of this on the solution of the problem are shown here in a numerical example. Finally, the mathematical programming model developed is described and the results of a brief computational experiment are presented.
dc.format.extent12
dc.language.isoeng
dc.relation.ispartofseriesIOC-DT-P
dc.relation.ispartofseries2005-5
dc.rightsAttribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.subjectÀrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d’operacions::Estratègia operativa
dc.subject.lcshLinear programming
dc.subject.otherAssembly line balancig
dc.subject.otherASALBP
dc.titleASALBP: The Alternative Subgraphs Assembly Line Balancing Problem
dc.typeExternal research report
dc.subject.lemacProgramació lineal -- Informes tècnics
dc.contributor.groupUniversitat Politècnica de Catalunya. EOLI - Enginyeria d'Organització i Logística Industrial
dc.rights.accessOpen Access
dc.relation.projectidcttCICYT DPI2004-03472
local.personalitzacitaciotrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 2.5 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 2.5 Spain