A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times
This work addresses the minimization of the makespan criterion for the permutation flow shop problem with blocking, sequence and machine dependent setup times, which is a problem that has not been studied in previous works. Many papers considered the problem with an unlimited buffer or with the setu...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Taylor & Francis Group
2017-01-01
|
| coleção: | Cogent Engineering |
| Assuntos: | |
| Acesso em linha: | http://dx.doi.org/10.1080/23311916.2017.1389638 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|