Fast neighborhood search for the single machine earliness-tardiness scheduling problem (Q2379655)
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 5685206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast neighborhood search for the single machine earliness-tardiness scheduling problem |
scientific article; zbMATH DE number 5685206 |
Statements
Fast neighborhood search for the single machine earliness-tardiness scheduling problem (English)
0 references
19 March 2010
0 references
machine scheduling
0 references
earliness-tardiness
0 references
neighborhood
0 references
iterated local search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8982031941413879
0 references
0.827698826789856
0 references
0.8234352469444275
0 references
0.8180294036865234
0 references
0.816251277923584
0 references
