Hybrid procedure based on Bounded Dynamic Programming and Linear Programming for solving a variant of the MMSP-W
View/Open
Cita com:
hdl:2117/19760
Document typeConference lecture
Defense date2013
Rights accessOpen Access
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
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
CitationBautista, 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.
Publisher versionhttp://www.prothius.com/pubs/MMSPW-MIM2013.pdf