The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (Q1577995)
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 1496366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability |
scientific article; zbMATH DE number 1496366 |
Statements
The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (English)
0 references
19 September 2000
0 references
manufacturing
0 references
complexity
0 references
discrete lot-sizing and scheduling problem
0 references
batch availability
0 references
mixed-integer linear program
0 references
simulated-annealing
0 references
0 references
0 references
0 references
0 references
0.8582139015197754
0 references
0.8563370704650879
0 references
0.8283382654190063
0 references
