Heuristics for the Response Time Variability problem

All of RECERCAT

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

dc.contributor	Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses
dc.contributor	Universitat Politècnica de Catalunya. EOLI - Enginyeria d'Organització i Logística Industrial
dc.contributor.author	Corominas Subias, Albert
dc.contributor.author	Kubiak, Wieslaw
dc.contributor.author	Pastor Moreno, Rafael
dc.date	2009-12-04
dc.identifier.uri	http://hdl.handle.net/2117/7050
dc.language.iso	eng
dc.relation	IOC-DT-P-2009-03
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
dc.subject	Industrial organization
dc.subject	Organització industrial
dc.title	Heuristics for the Response Time Variability problem
dc.type	info:eu-repo/semantics/draft
dc.type	info:eu-repo/semantics/report
dc.description.abstract	The recently introduced Response Time Variability Problem (RTVP) is a scheduling problem that has a broad range of real-life applications, for example, to sequence the models to be produced on a mixed-model assembly line. Previous studies include heuristic algorithms and mathematical programming models, whose practical limit for obtaining optimal solutions is around 40 units to be scheduled. In this paper, we propose and test new algorithms that combine heuristic procedures for obtaining initial sequences and several local optimization procedures.