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 | Lagermanagement | Warehouse management | Lagerhaltungsmodell | Inventory model | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Operations Research | Operations research |
-
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano, (2021)
-
A linear programming based heuristic algorithm for bandwidth packing problem with scheduling
Joung, Seulgi, (2020)
-
Melega, Gislaine Mara, (2021)
- More ...
-
Network flow methods for the minimum covariate imbalance problem
Hochbaum, Dorit S., (2022)
-
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 ...