- Tytuł:
- Permutation, no-wait, no-idle flow shop problems
- Autorzy:
- Makuchowski, M.
- Powiązania:
- https://bibliotekanauki.pl/articles/229973.pdf
- Data publikacji:
- 2015
- Wydawca:
- Polska Akademia Nauk. Czytelnia Czasopism PAN
- Tematy:
-
flow shop problem
permutation constraint
no-wait constraint
no-idle constraint
permutation-graph models - Opis:
- The paper compares the schedules of different variants of the flow shop problem, i.e. permutation, no waiting and no idle flow shop problems. It is assessed the impact of the constraints on the extension of the schedules and correlations of the length of the schedules for these variants. It is also examined the effectiveness of a set of insert type algorithms. The efficiency of the algorithms is tested on well-known literature benchmarks.
- Źródło:
-
Archives of Control Sciences; 2015, 25, 2; 189-199
1230-2384 - Pojawia się w:
- Archives of Control Sciences
- Dostawca treści:
- Biblioteka Nauki
Artykuł