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

Author： Alfieri A.   Brandimarte P.   D'Orazio S.  

Publisher： Taylor & Francis Ltd

ISSN： 0020-7543

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

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

Abstract

Related content

Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups

By Almada-Lobo Bernardo  

International Journal of Production Research, Vol. 48, Iss. 3, 2010-01 ,pp. : 861-878

Taylor & Francis Ltd

Access to resources Recommend Favorite

MIP-based fix-and-optimise algorithms for the parallel machine capacitated lot-sizing and scheduling problem

By Xiao Jing  

International Journal of Production Research, Vol. 51, Iss. 16, 2013-08 ,pp. : 5011-5028

Taylor & Francis Ltd

Access to resources Recommend Favorite

A heuristic approach for a multi-product capacitated lot-sizing problem with pricing

By González-Ramírez Rosa G.  

International Journal of Production Research, Vol. 49, Iss. 4, 2011-02 ,pp. : 1173-1196

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

By Kovalyov Mikhail Y.   Pesch Erwin  

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources

By Gicquel Celine  

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

Taylor & Francis Ltd

Access to resources Recommend Favorite