Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence (Q1702665)
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 6845354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence |
scientific article; zbMATH DE number 6845354 |
Statements
Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence (English)
0 references
28 February 2018
0 references
scheduling
0 references
delivery
0 references
batching
0 references
complexity
0 references
dynamic programming
0 references
0 references
0 references
0 references
0.8280588388442993
0 references
0.8238481879234314
0 references
0.810332179069519
0 references
0.800286591053009
0 references
0.7990664839744568
0 references
