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 the normal view instead:
scientific article; zbMATH DE number 6654029
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7864874601364136
0 references
0.7740107774734497
0 references
0.7684986591339111
0 references
0.7539464235305786
0 references
0.7539464235305786
0 references
