A dynamic programming based heuristic for the assembly line balancing problem

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/14000

dc.contributor	Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses
dc.contributor	Universitat Politècnica de Catalunya. PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació
dc.contributor	Universitat Politècnica de Catalunya. OPE - Organització de la Producció i d'Empresa (aspectes tècnics, jurídics i econòmics en Producció)
dc.contributor.author	Bautista Valhondo, Joaquín
dc.contributor.author	Pereira Gude, Jordi
dc.date	2009-05-01
dc.identifier.citation	Bautista, J.; Pereira, J. A dynamic programming based heuristic for the assembly line balancing problem. "European journal of operational research", 01 Maig 2009, vol. 194, núm. 3, p. 787-794.
dc.identifier.citation	0377-2217
dc.identifier.citation	10.1016/j.ejor.2008.01.016
dc.identifier.uri	http://hdl.handle.net/2117/14000
dc.language.iso	eng
dc.publisher	Elsevier
dc.relation	http://dx.doi.org/10.1016/j.ejor.2008.01.016
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions::Modelització de transports i logística
dc.subject	Production control
dc.subject	Producció -- Planificació
dc.subject	Direcció d'operacions
dc.subject	Producció -- Control
dc.subject	Automòbils -- Fabricació
dc.title	A dynamic programming based heuristic for the assembly line balancing problem
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/article
dc.description.abstract	The simple assembly line balancing problem is the simplification of a real problem associated to the assignment of the elementary tasks required for assembly of a product in an assembly line. This problem has been extensively studied in the literature for more than half a century. The present work proposes a new procedure to solve the problem we call Bounded Dynamic Programming. This use of the term Bounded is associated not only with the use of bounds to reduce the state space but also to the reduction of such space based on heuristics. This procedure is capable of obtaining an optimal solution rate of 267 out of 269 instances, which have been used in previous works, thus obtaining the best-known performance for the problem. These results are an improvement from any previous procedure found in the literature even when using smaller computing times.
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author