Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:57, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem |
scientific article |
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
