The replenishment schedule to minimize peak storage problem : the gap between the continuous and discrete versions of the problem
Year of publication: |
2019
|
---|---|
Authors: | Hochbaum, Dorit S. ; Rao, Xu |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 67.2019, 5, p. 1345-1361
|
Subject: | deterministic inventory theory | complexity | approximation algorithm | weakly NP-hard | integer programming | Theorie | Theory | Algorithmus | Algorithm | Lagermanagement | Warehouse management | Ganzzahlige Optimierung | Integer programming | Lagerhaltungsmodell | Inventory model | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming |
-
Jiang, Wei, (2021)
-
Storage location assignment and I/O location design on storage planning
Hu, Michael H., (2016)
-
Tapia-Ubeda, Francisco J., (2018)
- More ...
-
Algorithms and complexities of matching variants in covariate balancing
Hochbaum, Dorit S., (2023)
-
Complexity, algorithms and applications of the integer network flow with fractional supplies problem
Hochbaum, Dorit S., (2021)
-
A fully polynomial time approximation scheme for the replenishment storage problem
Hochbaum, Dorit S., (2020)
- More ...