Two-stage supply chain scheduling with an assignable common due window (Q5282671)
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: Two-stage supply chain scheduling with an assignable common due window |
scientific article; zbMATH DE number 6747343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-stage supply chain scheduling with an assignable common due window |
scientific article; zbMATH DE number 6747343 |
Statements
14 July 2017
0 references
due window
0 references
batch delivery
0 references
supply chain scheduling
0 references
dynamic programming algorithm
0 references
0.9042139649391174
0 references
0.851338803768158
0 references
0.8353960514068604
0 references
0.8343760371208191
0 references
