Hybrid procedure based on Bounded Dynamic Programming and Linear Programming for solving a variant of the MMSP-W
PublisherInternational Federation of Automatic Control (IFAC)
Rights accessOpen Access
In this paper, we propose a hybrid procedure based on Bounded Dynamic Programming (BDP) and linear programming to solve the Mixed-Model Sequencing Problem with Workload Minimization (MMSP-W), with serial workstations, free interruption of the operations and production mix restrictions. We performed a computational experiment with 225 instances from the literature. The results of our proposal are compared with those obtained through the Gurobi solver and previous procedures.
CitationBautista, J., Cano, A., Alfaro, R., Batalla, C. Hybrid procedure based on Bounded Dynamic Programming and Linear Programming for solving a variant of the MMSP-W. "IFAC Proceedings Volumes", 21 Juny 2013, vol. 46, núm. 9, p. 1908-1913.