Polynomial-time algorithms for deterministic uncapacitated lot-sizing problem with heterogeneous production cycles
Year of publication: |
2025
|
---|---|
Authors: | Yu, Tan ; Zhong, Xiang ; Guan, Yongpei |
Published in: |
Operations research letters : a journal of INFORMS devoted to the rapid publication of concise contributions in operations research. - Amsterdam [u.a.] : Elsevier Science, ISSN 0167-6377, ZDB-ID 1467065-3. - Vol. 61.2025, Art.-No. 107304, p. 1-6
|
Subject: | Dynamic programming | Heterogeneous production cycles | Polynomial-time algorithm | Uncapacitated lot-sizing problem | Theorie | Theory | Losgröße | Lot size | Dynamische Optimierung | Produktlebenszyklus | Product life cycle | Produktionssteuerung | Production control | Produktionsplanung | Production planning | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
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)
-
Capacitated lot sizing problem with periodic carbon emission constraints and multiple resources
Kocak, Esra, (2023)
- More ...
-
The impact of e-visits on patient access to primary care
Zhong, Xiang, (2018)
-
Reducing COPD readmissions through predictive modeling and incentive-based interventions
Zhong, Xiang, (2019)
-
Zhong, Xiang, (2017)
- More ...