No open-access location is known for this record yet.
No open-access location is known for this record yet.
Two policies are compared for the joint replenishment problem with a general ordering cost function. The fixed-cycle policy is solved using a dynamic programming approach, resulting in partitioning the items into groups. The basic-cycle policy uses a heuristic approach to partition the items into only two groups. A simulation model is developed to compare the effectiveness of the two policies and the EOQ approach.
Loading…
Stored only when both papers are in the corpus — 13 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.