A Lagrangean relaxation approach for capacitated lot sizing problem with setup times

Author： Cheng Chun-Hung   Madan Manohar S.   Motwani Jaideep   Yip Ka-Yun  

Publisher： Inderscience Publishers

ISSN： 1745-7645

Source： International Journal of Operational Research, Vol.18, Iss.3, 2013-09, pp. : 272-303

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

A possibilistic programming approach for capacitated lot-sizing problem in mixed assembly shops

By Sahebjamnia Navid   Andavari Yalda Yahiazadeh   Koleti Zahra Safaie   Orimi Hamed Gholami  

International Journal of Applied Decision Sciences, Vol. 6, Iss. 4, 2013-09 ,pp. : 388-405

Inderscience Publishers

Access to resources Recommend Favorite

An improved heuristic for the Capacitated Lot-Sizing problem

By Madan Manu S.   Cheng C.H.   Yip Eric   Motwani Jaideep  

International Journal of Operational Research, Vol. 7, Iss. 1, 2009-11 ,pp. : 90-108

Inderscience Publishers

Access to resources Recommend Favorite

An artificial bee colony approach for the undirected capacitated arc routing problem with profits

By Cura Tunchan  

International Journal of Operational Research, Vol. 17, Iss. 4, 2013-06 ,pp. : 483-508

Inderscience Publishers

Access to resources Recommend Favorite

A Lagrangean heuristic for the facility location problem with staircase costs

By Holmberg K.   Ling J.  

Location Science, Vol. 5, Iss. 3, 1997-10 ,pp. : 200-200

Elsevier

Access to resources Recommend Favorite

The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times

By Ng C.T.   Allahverdi Ali   Al-Anzi Fawaz S.   Cheng T.C. Edwin  

International Journal of Operational Research, Vol. 2, Iss. 2, 2007-02 ,pp. : 135-155

Inderscience Publishers

Access to resources Recommend Favorite