Robust Car Sequencing Problem: Description, models and metrics

Autor: Joaquín Bautista-Valhondo
Přispěvatelé: Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses, Universitat Politècnica de Catalunya. OPE-PROTHIUS - Organització de la Producció en Tallers Híbrids
Rok vydání: 2019
Předmět:
Zdroj: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
ISSN: 2171-6323
1132-175X
DOI: 10.37610/dyo.v0i68.555
Popis: The concept of partial demand uncertainty is introduced from the car sequencing problem (CSP) and incorporates special vehicle fleets in a demand plan. After establishing the working hypotheses with fleets, a mixed integer linear programming model, robust car sequencing problem (r-CSP), is proposed to satisfy the maximum number of CSP restrictions. Subsequently, multi-sequence production and metrics to evaluate its robustness are defined. The r-CSP considers various demand scenarios and functions to measure the excess of optional requirements in production programs. These functions are valid as objectives in optimization problems and as multi-sequence pro-duction robustness metrics. Keywords : Assembly lines, Sequencing, Car Sequencing Problem, Vehicle Fleets, Robust Optimization, Production Mix, Demand uncertainty.
Databáze: OpenAIRE