An improved heuristic for the Capacitated Lot-Sizing problem
by Manu S. Madan, C.H. Cheng, Eric Yip, Jaideep Motwani
International Journal of Operational Research (IJOR), Vol. 7, No. 1, 2010

Abstract: In this research, we present a heuristic for the Capacitated Lot-Sizing (CLS) problem without set-up time considerations and no backordering option. The CLS problem is formulated as a mixed integer-programming problem with an underlying fixed charge transportation problem structure. This formulation is flexible enough to handle different types of production capacity such as regular time capacity, overtime capacity and subcontracting. A heuristic that exploits the fixed charge transportation structure and trade-offs involved in lot-sizing decisions is developed for the problem. We also present a new Lower Bound Procedure for the multi-item CLS problems. We demonstrate the performance of the heuristic over a variety of test problems. The heuristic is evaluated by comparing the solution values to the lower bound values as well as to the solution values from another algorithm for similar problems.

Online publication date: Mon, 30-Nov-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com