A hybrid dynamic programming for solving a mixed-model sequencing problem with production mix restriction and free interruptions
Rights accessOpen Access
In this article, we propose a hybrid procedure based on bounded dynamic programming assisted by linear programming to solve the mixed-model sequencing problem with workload minimization 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 mixed integer linear programming.
CitationBautista, J., Cano, A., Alfaro, R. A hybrid dynamic programming for solving a mixed-model sequencing problem with production mix restriction and free interruptions. "Progress in Artificial Intelligence", Març 2017, vol. 6, núm. 1, p. 27-39.