Abstract
For the single-item capacitated lot-sizing problem with linear costs and no backlogging, we suggest a straightforward time algorithm, which does not need a polymatroid or min-cost flow problem reformulation.
Keywords:
PDF download + Online access
Issue Purchase
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.
Register now or learn more