Study of the configuration of a pre-assembly plant using maximum fill levels of units’ options


  • Julien Maheut Universidad Europea de Valencia



Assembly line, Automotive Industry, Simulation, Fill Level, Pull System


In this paper, a " pull " system to solve the problem of sequencing homogeneous units is defined. The literature and practice usually address this problem of " Push" mode in which an intelligent system calculates the next unit that the system must produce according to what is available . The proposed method suggests that the plant is fed with production orders (unit by unit) versus those that remain in the plant ( or rather those than miss). The case study of an assembly factory in which a new pre-assembly plant with parallel lines and alternate routings and pull off tables prior to the final assembly plant is introduced. The impact of restricting the number of units that receive high operating cycle time in the system consid-ering different indicators are studied. It is proposed to analyze the levels, theoretically con-sidering both physical space as existing times in the system. Finally , an analysis through a simulation based on discrete events with Simio Simulation Software® is proposed.


Download data is not yet available.

Author Biography

Julien Maheut, Universidad Europea de Valencia

Universidad Europea de Valencia - C/ General Elio 2 - 46010 Valencia


Bautista, J., & Cano, A. (2011). Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules. European Journal of Operational Research, 210(3), 495-513.

Bautista, J., Cano, A., & Alfaro, R. (2012). Modeling and solving a variant of the mixed-model sequencing problem with work overload minimisation and regularity constraints. An application in nissan’s barcelona plant. Expert Systems with Applications, 39(12), 11001-11010.

Boysen, N., Fliedner, M., & Scholl, A. (2009). Sequencing mixed-model assembly lines: Survey, classifi-cation and model critique. European Journal of Operational Research, 192(2), 349-373.

Drexl, A., Kimms, A., & Matthießen, L. (2006). Algorithms for the car sequencing and the level scheduling problem. Journal of Scheduling, 9(2), 153-176.

Garcia-Sabater, J. P., Maheut, J., & Garcia-Sabater, J. J. (2012). A two-stage sequential planning scheme for integrated operations planning and scheduling system using MILP: The case of an engine assembler. Flexible Services and Manufacturing Journal, 24(2), 171-209.

Maheut, J., Besga, J. M., Uribetxebarria, J., & Garcia-Sabater, J. (2014). A decision support system for modelling and implementing the supply network configuration and operations scheduling problem in the machine tool industry. Production Planning & Control, 25(8), 679-697. doi:10.1080/09537287.2013.798087

Valero Herrero, M., & Molina Morte, P. (2013). CSP dinámico: Un algoritmo dinámico para la resecuenciación en un almacén de líneas en paralelo. Working Papers on Operations Management, 4(1)

Valero-Herrero, M., García-Sabater, J. P., Hernández, J. R. C., & Maheut, J. (2011). Planteamiento diná-mico del problema de secuenciación en líneas de montaje con mezcla de modelos. V International Conference on Industrial Engineering and Industrial Management, 288-296.




How to Cite

Maheut, J. (2015). Study of the configuration of a pre-assembly plant using maximum fill levels of units’ options. WPOM-Working Papers on Operations Management, 6(1), 1–21.



Research Articles