Approximation schemes for the joint inventory selection and online resource allocation problem
Year of publication: |
2022
|
---|---|
Authors: | Chen, Xingxing ; Feldman, Jacob ; Jung, Seung Hwan ; Kouvelis, Panos |
Published in: |
Production and operations management : the flagship research journal of the Production and Operations Management Society. - London : Sage Publications, ISSN 1937-5956, ZDB-ID 2151364-8. - Vol. 31.2022, 8, p. 3143-3159
|
Subject: | approximation schemes | dynamic programming | greedy policy | inventory selection | online resource allocation | Theorie | Theory | Lagerhaltungsmodell | Inventory model | Mathematische Optimierung | Mathematical programming | Allokation | Allocation | Algorithmus | Algorithm | Lagermanagement | Warehouse management | Dynamische Optimierung | Dynamic programming |
-
An approximate dynamic-programming approach to the joint replenishment problem
Segev, Danny, (2014)
-
Online allocation and pricing : constant regret via Bellman inequalities
Vera, Alberto, (2021)
-
Joint optimization of dynamic lot and warehouse sizing problems
Fan, Jie, (2018)
- More ...
-
Approximation Schemes for the Joint Inventory Selection and Online Resource Allocation Problem
Chen, Xingxing, (2021)
-
Jung, Seung Hwan, (2020)
-
Managing Project Due Date and Material Supply in Project Supply Chains
Chen, Xingxing, (2021)
- More ...