Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness (Q711284): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Tabu search / rank | |||
Normal rank | |||
Revision as of 18:21, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness |
scientific article |
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
