Robust Car Sequencing Problem: Description, models and metrics

• Bautista-Valhondo, Joaquín ^[1]
  1. [1] Universitat Politècnica de Catalunya

     Universitat Politècnica de Catalunya

     Barcelona, España

     
• Localización: Dirección y organización: Revista de dirección, organización y administración de empresas, ISSN 1132-175X, Nº. 68, 2019, págs. 105-116
• Idioma: inglés
• Enlaces
  • Texto Completo Ejemplar
• Resumen

  • 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.