The capacitated lot sizing problem: a review of models and algorithms

Author： Karimi B.   Fatemi Ghomi S.M.T.   Wilson J.M.  

Publisher： Elsevier

ISSN： 0305-0483

Source： Omega, Vol.31, Iss.5, 2003-10, pp. : 365-378

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

Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times

By Denizel Meltem  

OR Spectrum, Vol. 30, Iss. 4, 2008-10 ,pp. : 773-785

Springer Publishing Company

Access to resources Recommend Favorite

Optimal lot sizing under continuous price decrease

By Khouja M.   Park S.  

Omega, Vol. 31, Iss. 6, 2003-12 ,pp. : 539-545

Elsevier

Access to resources Recommend Favorite

A Review and Comparison of Genetic Algorithms for the 0-1 Multidimensional Knapsack Problem

By  

International Journal of Operations Research and Information Systems (IJORIS), Vol. 6, Iss. 2, 2015-04 ,pp. : 21-31

IGI Global_journal

Access to resources Recommend Favorite

The berth allocation problem: models and solution methods

By Guan Yongpei   Cheung Raymond  

OR Spectrum, Vol. 26, Iss. 1, 2004-01 ,pp. : 75-92

Springer Publishing Company

Access to resources Recommend Favorite

Knowledge Management Models: A Summative Review

By  

International Journal of Information Systems in the Service Sector (IJISSS), Vol. 10, Iss. 1, 2018-01 ,pp. : 71-100

IGI Global_journal

Access to resources Recommend Favorite