Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost (Q4632945)
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 7049657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost |
scientific article; zbMATH DE number 7049657 |
Statements
Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost (English)
0 references
2 May 2019
0 references
parallel machines
0 references
batch delivery
0 references
FPTAS
0 references
worst-case performance
0 references
dynamic programming
0 references
0.9037488102912904
0 references
0.8735778331756592
0 references
0.8637673258781433
0 references
0.8595377206802368
0 references
0.8576892614364624
0 references
