Referenced Items are not available for this document.
In this work we introduce an innovative procedure to solve the capacitated lot sizing problem with backorders and setup times, called CLSP_BS. The procedure formulates CLSP_BS as a mixed integer programming (MIP) problem, reduces it to the structure of a bounded variable linear program; and then calculates some ratios of the coefficients to determine an approximate solution to the problem. This initial solution is further improved using an intelligent enumeration procedure. Adopting this procedure, we solve the NP hard MIP differently and easily, by mere calculation of a few ratios and without actually using any traditional solution approaches, viz. simplex, interior point method, etc.
Published in:
Computer and Automation Engineering (ICCAE), 2010 The 2nd International Conference on
(Volume:4
)
Date of Conference: 26-28 Feb. 2010
- Page(s):
- 18 - 22
- E-ISBN :
- 978-1-4244-5586-7
- Print ISBN:
- 978-1-4244-5585-0
- INSPEC Accession Number:
- 11259751
- Conference Location :
- Singapore
- Digital Object Identifier :
- 10.1109/ICCAE.2010.5451797
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
