Minimizing Total Completion Time in Mixed-Blocking Permutation Flowshops
Scheduling decisions are of certain cachet in production and operations management. Many extensions are developed to help address different scheduling industrial situations, one of which, the Mixed-Blocking Permutation Flowshop Scheduling Problem (MBPFSP), has gained recent recognition due to its wi...
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
IEEE
2020-01-01
|
| Serie: | IEEE Access |
| Soggetti: | |
| Accesso online: | https://ieeexplore.ieee.org/document/9157850/ |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|