unknown

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

Abstract

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

    Similar works