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
• DOI: 10.37610/dyo.v0i68.555
• 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.

• Referencias bibliográficas
  • Battaïa, O., Dolgui, A. (2013). “A taxonomy of line balancing problems and their solution approaches”. International Journal of Production...
  • Bautista, J. (2016). “Modelos y métricas para la versión robusta del Car Sequencing Problem con Flotas de vehículos especiales” Dirección...
  • Bautista, J., Alfaro, R. (2017). “Free and regular mixed-model sequences by a linear program-assisted hybrid algorithm GRASP-LP”. Progress...
  • Bautista, J., Batalla-García, C., Alfaro-Pozo, R. (2016). “Models for assembly line balancing by temporal, spatial and ergonomic risk attributes”....
  • Bautista, J., Cano, A. (2011). “Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimization...
  • Bautista, J., Cano, A., Alfaro, A. (2012). “Modeling and solving a variant of the mixed-model sequencing problem with work overload minimisation...
  • Bautista, J., Companys, R., Corominas, A. (1996). “Heuristics and exact algorithms for solving the Monden problem”. European Journal of Operational...
  • Bautista, J., Companys, R., Corominas, A. (1997). “Modelling and solving the production rate variation problem (PRVP)”. Top 5(2), pp 221–239....
  • Bautista, J., Pereira, J., Adenso-Díaz, B. (2008.a). “A GRASP approach for the extended car sequencing problem”. Journal of Scheduling 11,...
  • Bautista, J., Pereira, J., Adenso-Díaz, B. (2008.b). “A beam search approach for the optimization version of the car sequencing problem”....
  • Boysen, N., Fliedner, M., Scholl, A. (2009). “Sequencing mixed-model assembly lines: Survey, classification and model critique”. European...
  • Cano-Belmán, J., Ríos-Mercado, R.Z., Bautista, J. (2010). “A scatter search based hyper-heuristic for sequencing a mixed-model assembly line”....
  • Chica, M., Bautista, J., Cordón, O., Damas, S. (2016). “A multiobjective model and evolutionary algorithms for robust time and space assembly...
  • Corominas, A., Moreno, N. (2003). “On The Relations Between Optimal Solutions For Different Types Of MinSum Balanced Jit Optimisation Problems”....
  • Gent, I.P. (1998). “Two results on car-sequencing problems”. Report University of Strathclyde, APES-02-98.
  • Gottlieb, J., Puchta, M., Solnon, C. (2003). “A study of greedy, local search, and ant colony optimization approaches for car sequencing problems”....
  • Kis, T. (2004). “On the complexity of the car sequencing problem”. Operations Research Letters 32 (2004), pp 331-335. DOI: 10.1016/j.orl.2003.09.003
  • Little, J. (1993). “A searching technique!”. OR Insight, 6(4), pp 24–31. DOI: 10.1057/ori.1993.25
  • Monden, Y. (1994). Toyota Production System. An Integrated Approach to Just-In-Time. Ed. Springer US. DOI: 10.1007/978-1-4615-9714-8
  • Morin, S., Gagné, C., Gravel, M. (2009). “Ant colony optimization with a specialized pheromone trail for the car-sequencing problem”. European...
  • Parrello, B.D., Kabat, W.C., Wos, L. (1986). “Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem”....
  • Ribeiro, C.C., Aloise, D., Noronha, T.F., Rocha, C., Urrutia, S. (2008). “An efficient implementation of a VNS/ILS heuristic for a real-life...
  • Siala, M., Hebrard, E., Huguet, M.J. (2015). “A study of constraint programming heuristics for the car-sequencing problem”. Engineering Applications...
  • Yano, C.A., Rachamadugu, R. (1991). “Sequencing to Minimize Work Overload in Assembly Lines with Product Options” Management Science 37(5),...