Stronger upper and lower bounds for a hard batching problem to feed assembly lines (Q3503545)
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: Stronger upper and lower bounds for a hard batching problem to feed assembly lines |
scientific article; zbMATH DE number 5284992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stronger upper and lower bounds for a hard batching problem to feed assembly lines |
scientific article; zbMATH DE number 5284992 |
Statements
Stronger upper and lower bounds for a hard batching problem to feed assembly lines (English)
0 references
5 June 2008
0 references
assembly lines
0 references
lot-sizing in batches
0 references
integer programming
0 references
0.8688724
0 references
0.8539211
0 references
0 references
0 references
0.8451518
0 references
0.84311146
0 references
0.83944565
0 references
