A bounded dynamic programming algorithm for the MMSP-W considering workstation dependencies and unrestricted interruption of the operations
View/Open
MMSPW_BDP_ISDA2011.pdf (3,025Mb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Document typePart of book or chapter of book
Defense date2011-11-22
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Rights accessRestricted access - publisher's policy
Abstract
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.
ISBN978-1-4577-1676-8
Publisher versionhttp://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6112291
Files | Description | Size | Format | View |
---|---|---|---|---|
MMSPW_BDP_ISDA2011.pdf![]() | 3,025Mb | Restricted access |
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain