Heuristics for the Response Time Variability problem
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 mod...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2009 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/7050 |
| Acceso en línea: | https://hdl.handle.net/2117/7050 |
| Access Level: | acceso abierto |
| Palabra clave: | Industrial organization Organització industrial Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions |
| Sumario: | 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. |
|---|