The Continuous-Time Joint Replenishment Problem: ϵ-Optimal Policies via Pairwise Alignment
D Segev - Management Science, 2024 - pubsonline.informs.org
The main contribution of this paper resides in developing a new algorithmic approach for
addressing the continuous-time joint replenishment problem, termed Ψ-pairwise alignment …
addressing the continuous-time joint replenishment problem, termed Ψ-pairwise alignment …
替代竞争情境下考虑期初库存水平和存储能力约束的多周期订货博弈问题研究
张剑, 何爽, 师璞杰, 张菊亮 - 中国管理科学, 2024 - zgglkx.com
本文研究了期初库存水平和存储能力约束下缺货替代竞争的多周期订货博弈问题.
两种可相互替代的产品分别由两个零售商销售, 当购买某一产品的顾客遇到缺货时会转而购买 …
两种可相互替代的产品分别由两个零售商销售, 当购买某一产品的顾客遇到缺货时会转而购买 …
Improved Approximation Guarantees for Joint Replenishment in Continuous Time
D Segev - arXiv preprint arXiv:2408.05443, 2024 - arxiv.org
The primary objective of this work is to revisit and revitalize one of the most fundamental
models in deterministic inventory management, the continuous-time joint replenishment …
models in deterministic inventory management, the continuous-time joint replenishment …
Economic optimisation of cold production: a matheuristic with artificial neural network approach
A Ribault, S Vercraene, S Henry… - International journal of …, 2021 - Taylor & Francis
In this paper, the economic optimisation of cold storage is studied. A modern cold room is
mainly composed of compressors, a tank to store heat-transfer fluid and cold rooms. The …
mainly composed of compressors, a tank to store heat-transfer fluid and cold rooms. The …
The Continuous-Time Joint Replenishment Problem: -Optimal Policies via Pairwise Alignment
D Segev - arXiv preprint arXiv:2302.09941, 2023 - arxiv.org
The main contribution of this paper resides in developing a new algorithmic approach for
addressing the continuous-time joint replenishment problem, termed $\Psi $-pairwise …
addressing the continuous-time joint replenishment problem, termed $\Psi $-pairwise …
Approximation algorithms for k-echelon extensions of the one warehouse multi-retailer problem
G Stauffer - Mathematical Methods of Operations Research, 2018 - Springer
In this paper, we consider k-echelon extensions of the deterministic one warehouse multi-
retailer problem. We give constant factor approximation algorithms for some of these …
retailer problem. We give constant factor approximation algorithms for some of these …
Decomposition‐based approximation algorithms for the one‐warehouse multi‐retailer problem with concave batch order costs
W Hu, Z Yu, A Toriello… - Naval Research Logistics …, 2020 - Wiley Online Library
We study the one‐warehouse multi‐retailer problem under deterministic dynamic demand
and concave batch order costs, where order batches have an identical capacity and the …
and concave batch order costs, where order batches have an identical capacity and the …
[PDF][PDF] Decomposition-based approximation algorithms for the one-warehouse multi-retailer problem with concave batch order costs
We study the one-warehouse multi-retailer (OWMR) problem under deterministic dynamic
demand and concave batch order costs, where order batches have an identical capacity and …
demand and concave batch order costs, where order batches have an identical capacity and …
Optimization methods for multi-level lot-sizing problems
G Goisque - 2017 - theses.hal.science
In this thesis we are interested in several multi-level lot-sizing problems taking into account
production capacities. We first study a 2-level in series lot-sizing problem with identical and …
production capacities. We first study a 2-level in series lot-sizing problem with identical and …
[PDF][PDF] The One-Warehouse Multi-Retailer Problem with Four Types of Emission Constraints
J Liu - 2019 - biblos.hec.ca
In this thesis, we address the one-warehouse-multi-retailer (OWMR) problem. We consider a
plant that produces a single type of product and replenishes multiple retailers with dynamic …
plant that produces a single type of product and replenishes multiple retailers with dynamic …