Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness (Q711284)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness |
scientific article; zbMATH DE number 5804910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness |
scientific article; zbMATH DE number 5804910 |
Statements
Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness (English)
0 references
25 October 2010
0 references
scheduling
0 references
non-permutation flowshop
0 references
tardiness
0 references
MILP model
0 references
tabu search
0 references
0 references
0 references
0.8872371315956116
0 references
0.8631154298782349
0 references
0.8413655161857605
0 references
0.8386716246604919
0 references
