Solving a Mixed-Model Sequencing Problem with production mix restriction by Bounded Dynamic Programming

MMSP-W con restricciones PMR mediante BDPIn this article, we propose a hybrid procedure based on bounded dynamic programming (BDP) assisted by linear programming to solve the mixed-model sequencing problem with workload minimization (MMSP-W) with serial workstations, free interruption of the operations and with production mix restrictions. We performed a computational experiment with 23 instances related to a case study of the Nissan powertrain plant located in Barcelona. The results of our proposal are compared with those obtained by the Gurobi solver and previous procedures.Preprin

Modelado y resolución de problemas de secuenciación en contexto JIT/DS mediante BDP

This document develops the doctoral thesis entitled "Modelado y resolución de problemas de secuenciación en contexto JIT/DS mediante BDP". Through a literature review we explain the problems, within the environment of the sequence problems in production systems. Then, we describe the problems under study, the MMSP-W (Mixed-Model Sequencing Problem with Work overload Minimization), the BFSP (Blocking Flow Shop Problem) and the ORV (Output Rate Variation Problem). Then, a resolution procedure based on BDP (Bounded Dynamic Programming) to solve the problems is proposed. Finally, the results of the proposed procedure are compared with others based on for example linear programming or heuristics.Este documento desarrolla la tesis doctoral titulada “Modelado y resolución de problemas de secuenciación en contexto JIT/DS mediante BDP”. A través de una revisión de la literatura se explican los problemas objeto de estudio, enmarcándolo dentro del entorno de la secuenciación en los sistemas productivos. A continuación se describen dichos problemas, el MMSP-W (Mixed-Model Sequencing Problem with Work overload Minimization), el BFSP (Blocking Flow Shop Problem) y el ORV (Output Rate Variation Problem). Finalmente se proponen algoritmos de resolución para dichos problemas basados en BDP (Bounded Dynamic Programming o programación dinámica acotada) y se compara la calidad de los procedimientos propuestos con otros basados en programación lineal o heurística