Approximating the Joint replenishment Problem with Deadlines

@article{Nonner2009ApproximatingTJ,
  title={Approximating the Joint replenishment Problem with Deadlines},
  author={Tim Nonner and Alexander Souza},
  journal={Discrete Math., Alg. and Appl.},
  year={2009},
  volume={1},
  pages={153-174}
}
The objective of the classical Joint Replenishment Problem (JRP) is to minimize ordering costs by combining orders in two stages, first at some retailers, and then at a warehouse. These orders are needed to satisfy demands that appear over time at the retailers. We investigate the natural special case that each demand has a deadline until when it needs to be satisfied. For this case, we present a randomized 5/3-approximation algorithm. We moreover prove that JRP with deadlines is APX-hard… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Computational complexity of uncapacitated multi-echelon production planning problems

  • E. Arkin, D. Joneja, R. Roundy
  • Operations Research Letters,
  • 1989
Highly Influential
6 Excerpts

Multi-item inventory models with co-ordinated replenishments: A survey

  • Yasemin Aksoy, S. Selcuk Erenguc
  • International Journal of Operations Production…
  • 1988
Highly Influential
7 Excerpts

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

  • Martin Charles Golumbic
  • 2004
Highly Influential
4 Excerpts

Shmoys . A constant approximation algorithm for the onewarehouse multiretailer problem

  • Retsef Levi, Robin Roundy, B. David
  • 2005

Similar Papers

Loading similar papers…