Approximation algorithms for the joint replenishment problem with deadlines
| Year of publication: |
2015
|
|---|---|
| Authors: | Bienkowski, Marcin ; Byrka, Jarosław ; Chrobak, Marek ; Dobbs, Neil ; Nowicki, Tomasz |
| Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 18.2015, 6, p. 545-560
|
| Subject: | Joint replenishment problem | NP-completeness | APX-hardness | Approximation algorithms | Algorithmus | Algorithm | Lagerhaltungsmodell | Inventory model | Theorie | Theory |
-
Pasandideh, Hamid Reza, (2020)
-
An efficient algorithm for a generalized joint replenishment problem
Frenk, Johannes G., (1997)
-
Joint replenishment problem for multi-echelon system with planned shortage
Roushdy, Bassem, (2015)
- More ...
-
Online algorithms for multilevel aggregation
Bienkowski, Marcin, (2020)
-
Scheduling with gaps : new models and algorithms
Chrobak, Marek, (2021)
-
A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines
Bellenguez-Morineau, Odile, (2015)
- More ...