Hybrid procedure based on Bounded Dynamic Programming and Linear Programming for solving a variant of the MMSP-W
Tipo de documentoComunicación de congreso
Fecha de publicación2013
Condiciones de accesoAcceso abierto
n this paper, we propose a hybrid procedure based on Bounded Dynamic Programming ( BDP ) and linear programming to solve the Mixed - Model Se quencing 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
CitaciónBautista, J. [et al.]. Hybrid procedure based on Bounded Dynamic Programming and Linear Programming for solving a variant of the MMSP-W. A: IFAC Conference on Manufacturing Modelling, Management, and Control. "MIM'2013 Saint Petersburg, IFAC IFIP IEEE Conference on Manufacturing Modelling, Management and Control, June 19-21, 2013, Saint Petersburg, Russia". Saint Petersburg: 2013, p. 1943-1948.
Versión del editorhttp://www.prothius.com/pubs/MMSPW-MIM2013.pdf