Applying variable neighborhood search to the single-machine maximum lateness rescheduling problem (Q2840760)
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: Applying variable neighborhood search to the single-machine maximum lateness rescheduling problem |
scientific article; zbMATH DE number 6190290
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Applying variable neighborhood search to the single-machine maximum lateness rescheduling problem |
scientific article; zbMATH DE number 6190290 |
Statements
23 July 2013
0 references
variable neighborhood search
0 references
rescheduling
0 references
single machine
0 references
Applying variable neighborhood search to the single-machine maximum lateness rescheduling problem (English)
0 references
