No open-access location is known for this record yet.
No open-access location is known for this record yet.
This note considers the joint replenishment inventory problem for N items under constant demand. The frequently-used cyclic strategy (T; k1, …, kN) is investigated: a family replenishment is made every T time units and item i is included in each ki th replenishment. Goyal proposed a solution to find the global optimum within the class of cyclic strategies. However, we will show that the algorithm of Goyal does not always lead to the optimal cyclic strategy. A simple correction is suggested.
Loading…
Stored only when both papers are in the corpus — 88 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.