Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness (Q711284): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2010.05.089 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2010.05.089 / rank | |||
Normal rank | |||
Revision as of 07:46, 9 December 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
0 references
0 references
