Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048)
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: Split-merge: using exponential neighborhood search for scheduling a batching machine |
scientific article; zbMATH DE number 6654029
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Split-merge: using exponential neighborhood search for scheduling a batching machine |
scientific article; zbMATH DE number 6654029 |
Statements
Split-merge: using exponential neighborhood search for scheduling a batching machine (English)
0 references
17 November 2016
0 references
batching machine
0 references
maximum lateness
0 references
local search
0 references
exponential neighborhoods
0 references
dynamic programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
