A Lagrangean relaxation approach for capacitated lot sizing problem with setup times
by Chun-Hung Cheng; Manohar S. Madan; Jaideep Motwani; Ka-Yun Yip
International Journal of Operational Research (IJOR), Vol. 18, No. 3, 2013

Abstract: In this research, we consider a production planning problem that determines the production timings and quantities for multiple products over a finite number of periods without violating capacity constraints. This problem is commonly referred to as the capacitated lot sizing (CLS) problem. We develop a model that explicitly considers setup times for products and different types of production capacities such as regular time and overtime. We develop a heuristic based on Lagrangian relaxation to solve this CLS problem. Computational results show that our algorithm gives reliable results while comparing solution values to lower bounds.

Online publication date: Tue, 29-Jul-2014

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