Multiechelon lot sizing : new complexities and inequalities
| Year of publication: |
2020
|
|---|---|
| Authors: | Zhao, Ming ; Zhang, Minjiao |
| Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 68.2020, 2, p. 534-551
|
| Subject: | analysis of algorithms: computational complexity | programming: integer | algorithms | cutting plane | Optimization | lot sizing | dynamic programming | network flow | polynomial-time algorithms | valid inequalities | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Losgröße | Lot size | Algorithmus | Algorithm | Dynamische Optimierung | Dynamic programming | Produktionssteuerung | Production control |
-
A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs
Bunn, Kevin A., (2023)
-
Discrete multi-module capacitated lot-sizing problems with multiple items
Kulkarni, Kartik, (2022)
-
Goisque, Guillaume, (2017)
- More ...
-
Differentiating Interhospital Transfer Types : Varied Impacts and Diverging Coordination Strategies
Fan, Raymond Lei, (2021)
-
A polyhedral study on fuel-constrained unit commitment
Pan, Kai, (2022)
-
Robust sourcing under multilevel supply risks : analysis of random yield and capacity
Zhao, Ming, (2023)
- More ...