Cargando…
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
An uncertain version of the permutation flow-shop with unlimited buffers and the makespan as a criterion is considered. The investigated parametric uncertainty is represented by given interval-valued processing times. The maximum regret is used for the evaluation of uncertainty. Consequently, the mi...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer Berlin Heidelberg
2017
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5767222/ https://www.ncbi.nlm.nih.gov/pubmed/29375268 http://dx.doi.org/10.1007/s10100-017-0485-8 |