A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153)
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: A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem |
scientific article; zbMATH DE number 2132789
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem |
scientific article; zbMATH DE number 2132789 |
Statements
A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (English)
0 references
9 February 2005
0 references
Scheduling
0 references
Dynamic programming
0 references
Local search
0 references
Exponential neighborhoods
0 references
0 references
0 references
0 references
0 references
