Lot-size scheduling of a single product on unrelated parallel machines (Q2174901)
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 7193673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lot-size scheduling of a single product on unrelated parallel machines |
scientific article; zbMATH DE number 7193673 |
Statements
Lot-size scheduling of a single product on unrelated parallel machines (English)
0 references
27 April 2020
0 references
scheduling
0 references
parallel machines
0 references
lot-sizing
0 references
computational complexity
0 references
approximation
0 references
0 references
0.8459335565567017
0 references
0.8427956104278564
0 references
0.8366338014602661
0 references
0.8249848484992981
0 references
0.813860297203064
0 references
