A hybrid dynamic programming for solving a mixed-model sequencing problem with production mix restriction and free interruptions
PublisherSpringer Berlin Heidelberg
Rights accessRestricted access - publisher's policy (embargoed until 2017-08-30)
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", 30 Agost 2016, vol. 5, núm. August 2016, p. 1-13.
ISSN2192-6360 (Online ISSN)
|PRAI-2016_MMSPW-PMR-BDP2_V6 Postprint_20160901.pdf||357.1Kb||Restricted access|