Note on "an efficient approach for solving the lot-sizing problem with time-varying storage capacities"

Wilco van den Heuvel, José Miguel Gutiérrez and Hark-Chin Hwang

In a recent paper Gutiérrez et al. (2008) show that the lot-sizing problem with inventory bounds can be solved in O(T log T) time. In this note we show that their algorithm does not lead to an optimal solution in general.

Year of publication:	2010
Authors:	Heuvel, Wilco van den ; Gutiérrez, José Miguel ; Hwang, Hark-Chin
Publisher:	Rotterdam : Econometric Institute
Subject:	Losgröße \| Lot size \| Mathematische Optimierung \| Mathematical programming \| Algorithmus \| Algorithm \| Lagerhaltungsmodell \| Inventory model \| Theorie \| Theory

freely available

Full text |

More access options

nbn-resolving.org

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10008839871

A service of the