Evaluating optimization models to solve SALBP

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/6071

dc.contributor	Universitat Politècnica de Catalunya. Institut d'Organització i Control de Sistemes Industrials
dc.contributor	Universitat Politècnica de Catalunya. EOLI - Enginyeria d'Organització i Logística Industrial
dc.contributor.author	Pastor Moreno, Rafael
dc.contributor.author	Ferrer Martí, Laia
dc.contributor.author	García Villoria, Alberto
dc.date	2007-08
dc.identifier.citation	Pastor, R.; Ferrer, L.; García, A. "Evaluating optimization models to solve SALBP". Lecture Notes in Computer Science, 2007, No. 4705, p. 791-803.
dc.identifier.citation	0302-9743
dc.identifier.uri	http://hdl.handle.net/2117/6071
dc.language.iso	eng
dc.publisher	Springer Verlag
dc.relation	http://dx.doi.org/10.1007/978-3-540-74472-6_65
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions
dc.subject	Assembly-line balancing
dc.subject	Assembly line balancing
dc.subject	Equilibrat de línies de muntatge
dc.subject	Equilibrado de líneas de montaje
dc.subject	Treball en cadena
dc.title	Evaluating optimization models to solve SALBP
dc.type	info:eu-repo/semantics/article
dc.description.abstract	This work evaluates the performance of constraint programming (CP) and integer programming (IP) formulations to solve the Simple Assembly Line Balancing Problem (SALBP) exactly. Traditionally, its exact solution by CP or IP and standard software has been considered to be inefficient to real-world instances. However, nowadays this is becoming more realistic thanks to recent improvements both in hardware and software power. In this context, analyzing the best way to model and to solve SALBP is acquiring relevance. The aim of this paper is to identify the best way to model SALBP-1 (minimizing the number of stations, for a given cycle time) and SALBP-2 (minimizing the cycle time, for a given number of stations). In order to do so, a wide computational experiment is carried out to analyze the performance of one CP and three IP formulations to solve each problem. The results reveal which of the alternative models and solution techniques is the most efficient to solve SALBP-1 and SALBP-2, respectively.
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