The periodic joint replenishment problem is strongly NP-hard
Year of publication: |
November 2018
|
---|---|
Authors: | Cohen-Hillel, Tamar ; Yedidsion, Liron |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 43.2018, 4, p. 1269-1289
|
Subject: | computational complexity | joint replenishment problem | supply chain management | twin primes | Lieferkette | Supply chain | Lagerhaltungsmodell | Inventory model | Theorie | Theory |
-
Bi-objective optimisation of the joint replenishment problem in a two-echelon supply chain
Ahmadi, Pejman, (2021)
-
Otero-Palencia, Carlos, (2019)
-
Dual sourcing under random supply capacities : the role of the slow supplier
Tan, Burcu, (2016)
- More ...
-
High-Low Promotion Policies for Peak-End Demand Models
Cohen-Hillel, Tamar, (2019)
-
Bounded Memory Peak End Models Can Be Surprisingly Good
Cohen-Hillel, Tamar, (2019)
-
Detecting Customer Trends for Optimal Promotion Targeting
Baardman, Lennart, (2019)
- More ...