The <i>G</i>-group heuristic for single machine lot scheduling (Q3755218)
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: The G-group heuristic for single machine lot scheduling |
scientific article; zbMATH DE number 4003888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The <i>G</i>-group heuristic for single machine lot scheduling |
scientific article; zbMATH DE number 4003888 |
Statements
The <i>G</i>-group heuristic for single machine lot scheduling (English)
0 references
1987
0 references
heuristic
0 references
single-machine, multi-product, infinite-horizon, lot scheduling problem
0 references
0 references
0.9015355
0 references
0.8689042
0 references
0.8611796
0 references
0.8552886
0 references
0.8525823
0 references
