An online joint replenishment problem combined with single machine scheduling

DOI10.1007/s10878-023-01064-zarXiv2208.02748MaRDI QIDQ6166202

Tamás Kis, Tímea Tamási, Péter Györgyi

Publication date: 2 August 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.02748

zbMATH Keywords

single machine schedulingonline algorithmjoint replenishmentmaximum flow time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Cites Work

• The submodular joint replenishment problem
• Computational complexity of uncapacitated multi-echelon production planning problems
• A review of the joint replenishment problem literature: 1989--2005
• Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
• A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms
• Better Approximation Bounds for the Joint Replenishment Problem
• Primal-Dual Algorithms for Deterministic Inventory Problems
• Joint replenishment meets scheduling

This page was built for publication: An online joint replenishment problem combined with single machine scheduling