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

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.52, Iss.13, 2014-07, pp. : 3758-3761

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Comparison of just-in-time and time window delivery policies for a single-item capacitated lot sizing problem

By Akbalik Ayse

International Journal of Production Research, Vol. 49, Iss. 9, 2011-05 ,pp. : 2567-2585

Taylor & Francis Ltd

Access to resources Recommend Favorite

Multi-item capacitated lot-sizing with demand uncertainty

By Brandimarte Paolo

International Journal of Production Research, Vol. 44, Iss. 15, 2006-08 ,pp. : 2997-3022

Taylor & Francis Ltd

Access to resources Recommend Favorite

An effective approach to multi-item capacitated dynamic lot-sizing problems

By Li Yanzhi

International Journal of Production Research, Vol. 50, Iss. 19, 2012-10 ,pp. : 5348-5362

Taylor & Francis Ltd

Access to resources Recommend Favorite

LP-based heuristics for the capacitated lot-sizing problem: the interaction of model formulation and solution algorithm

By Alfieri A. Brandimarte P. D'Orazio S.

International Journal of Production Research, Vol. 40, Iss. 2, 2002-01 ,pp. : 441-458

Taylor & Francis Ltd

Access to resources Recommend Favorite

A new Silver-Meal based heuristic for the single-item dynamic lot sizing problem with returns and remanufacturing

By Schulz Tobias

International Journal of Production Research, Vol. 49, Iss. 9, 2011-05 ,pp. : 2519-2533

Taylor & Francis Ltd

Access to resources Recommend Favorite