Advanced search
Publication Cover
International Journal of Production Research Volume 52, 2014 - Issue 13: New Developments in Scheduling and Manufacturing
Submit an article Journal homepage
230
Views
4
CrossRef citations to date
0
Altmetric
Articles

An O(n log n) algorithm for a single-item capacitated lot-sizing problem with linear costs and no backlogging

Mikhail Y. KovalyovUnited Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus.
&
Erwin PeschFaculty III, Institute of Information Systems, University of Siegen, Siegen, Germany.Correspondence[email protected]
Pages 3758-3761 | Received 10 Jan 2013, Accepted 09 Oct 2013, Published online: 21 Nov 2013
 
Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days

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.

Log in via your institution

Access through your institution

Log in to Taylor & Francis Online

Restore content access

Restore content access for purchases made as guest
Purchase options * Save for later

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 973.00 Add to cart

* Local tax will be added as applicable

Related Research

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.