Approximation algorithms for the joint replenishment problem with deadlines
Publication:906550
DOI10.1007/s10951-014-0392-yzbMath1333.90015arXiv1212.3233MaRDI QIDQ906550
Publication date: 22 January 2016
Published in: Journal of Scheduling, Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.3233
linear programming; approximation algorithm; NP-completeness; approximation algorithms; randomized rounding; APX-hardness; integrality gap; joint replenishment problem; inventory theory; joint replenishment problem with deadlines
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
