Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772)
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: Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem |
scientific article; zbMATH DE number 5028818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem |
scientific article; zbMATH DE number 5028818 |
Statements
Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (English)
0 references
29 May 2006
0 references
scheduling
0 references
single machine
0 references
earliness-tardiness cost
0 references
neighborhoods
0 references
search method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8982031941413879
0 references
0.8424941301345825
0 references
0.8234907388687134
0 references
0.8123175501823425
0 references
0.8111473917961121
0 references
