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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Losgröße | Lot size |
-
Formulations and solution algorithms for dynamic assembly routing problem
Afsar, H. Murat, (2020)
-
A multi-phase algorithm for a joint lot-sizing and pricing problem with stochastic demands
Li, Hongyan, (2014)
-
Improved exact algorithms to economic lot-sizing with piecewise linear production costs
Ou, Jinwen, (2017)
- More ...
-
Improving physician schedules by leveraging equalization : cases from hospitals in U.S.
Damcı-Kurt, Pelin, (2019)
-
Capacitated lot-sizing problem with outsourcing
Zhang, Minjiao, (2015)
-
A polyhedral study of multiechelon lot sizing with intermediate demands
Zhang, Minjiao, (2012)
- More ...