A bounded dynamic programming algorithm for the MMSP-W considering workstation dependencies and unrestricted interruption of the operations
Document typePart of book or chapter of book
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Rights accessRestricted access - publisher's policy
In this paper, we propose a procedure based on Bounded Dynamic Programming ( BDP ) to solve the Mixed- Model Sequencing Problem with Workload Minimisation ( MMSP-W ), with serial workstations and unrestricted (or free) interruption of the operations. We performed a computational experiment with 225 instances from the literature. The results of our proposal are compared with those obtained through the CPLEX solver.
CitationBautista, J., Cano, A., Alfaro, R. A bounded dynamic programming algorithm for the MMSP-W considering workstation dependencies and unrestricted interruption of the operations. A: "Intelligent Systems Design and Applications (ISDA), 2011 11th International Conference on". Institute of Electrical and Electronics Engineers (IEEE), 2011, p. 289-294.