A global optimum search algorithm for the joint replenishment problem under power-of-two policy. (Q1868815)
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: A global optimum search algorithm for the joint replenishment problem under power-of-two policy. |
scientific article; zbMATH DE number 1901872
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A global optimum search algorithm for the joint replenishment problem under power-of-two policy. |
scientific article; zbMATH DE number 1901872 |
Statements
A global optimum search algorithm for the joint replenishment problem under power-of-two policy. (English)
0 references
28 April 2003
0 references
Inventory
0 references
Scheduling
0 references
Lot size
0 references
Global optimum
0 references
0 references
0 references
0 references
0 references
0 references
0.89825064
0 references
0.89679456
0 references
0.89409035
0 references
0.8936333
0 references
0 references
0.8794694
0 references
0.8794594
0 references
0.8758321
0 references
0.8734745
0 references
