An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time (Q2084598)
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 7603261
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time |
scientific article; zbMATH DE number 7603261 |
Statements
An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time (English)
0 references
18 October 2022
0 references
supply chain scheduling
0 references
due window assignment
0 references
holding time
0 references
approximation algorithm
0 references
fully polynomial-time approximation scheme
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9042139649391174
0 references
0.8676310777664185
0 references
0.8548345565795898
0 references
0.8233314156532288
0 references
