MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs

E-ISSN： 1290-3868|41|2|171-192

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.41, Iss.2, 2007-06, pp. : 171-192

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

Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities

By Deleplanque Samuel Kedad-Sidhoum Safia Quilliot Alain

RAIRO - Operations Research, Vol. 47, Iss. 4, 2013-11 ,pp. : 429-443

Edp Sciences

Access to resources Recommend Favorite

Multi-objective optimization of integrated lot-sizing and scheduling problem in flexible job shops

By Rohaninejad Mohammad Sahraeian Rashed Nouri Behdin Vahedi

RAIRO - Operations Research, Vol. 50, Iss. 3, 2016-07 ,pp. : 587-609

Edp Sciences

Access to resources Recommend Favorite

Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds

By Briand Cyril Ourari Samia

RAIRO - Operations Research, Vol. 47, Iss. 1, 2013-02 ,pp. : 33-46

Edp Sciences

Access to resources Recommend Favorite

Lot-sizing for production planning in a recovery system with returns

By Zouadi Tarik Yalaoui Alice Reghioui Mohamed El Kadiri Kamal Eddin

RAIRO - Operations Research, Vol. 49, Iss. 1, 2014-12 ,pp. : 123-142

Edp Sciences

Access to resources Recommend Favorite

Solving the Capacitated Vehicle Routing Problem Based on Improved Ant-clustering Algorithm

MATEC Web of conference, Vol. 22, Iss. issue, 2015-07 ,pp. : 03022-03022

Edp Sciences

Access to resources Recommend Favorite