What type of study is this?

This is a Quantitative Study study.

September 23, 2025Open Access

Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs

View Full Paper

Ask AI

Bookmark

Authors

Research resolves open problem in joint replenishment, designing dynamic priority algorithms, suggesting implications for supply chain planning.

A new 16-competitive algorithm was designed for the multi-item joint replenishment problem, addressing the open issue of holding and backlog costs.
The research establishes a 4-competitive algorithm for the single-item case, improving upon previous models with arbitrary functions for costs.
Dynamic priority over requests is suggested, allowing more flexible servicing compared to fixed priority based on deadlines.
This study holds significant implications for optimizing supply chain planning with complex cost structures.

Azar et al. (2025) studied this question.

View Full Paper

Ask AI

Bookmark

Research resolves open problem in joint replenishment, designing dynamic priority algorithms, suggesting implications for supply chain planning.