Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (Q1615940)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6969585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic |
scientific article; zbMATH DE number 6969585 |
Statements
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (English)
0 references
31 October 2018
0 references
scheduling
0 references
non-permutation flowshop
0 references
time lags
0 references
mathematical programming
0 references
heuristics
0 references
lexicographic optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8915546536445618
0 references
0.8752599358558655
0 references
0.860859751701355
0 references
0.8547685146331787
0 references
