Heuristic for integrated purchasing and production planning
The planning of purchasing and production lot-size for multi-item multi-period multi-workstation capacitated production (MLCLSP-M) is discussed. Since the model is a NP-hard problem, this research proposes a heuristic method (A-LS), which decomposes the model into two sub-problems and iteratively solves them. The two sub-problems consisting of an assignment sub-problem with given lot size and a lot sizing sub-problem with given assignment. Solution method was developed, tested and compared to illustrate the solution quality and computational time. Mathematical models for both sub-problems were solved with AMPL/CPLEX 8.0.0 solver. The computational results indicate that the proposed heuristic (A-LS) gives satisfactory solution with faster solving time comparing with the original mathematical model. [Submitted 15 July 2008; Revised 09 October 2009, 09 December 2009; Accepted 23 December 2009]
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 5 (2011)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://www.inderscience.com/browse/index.php?journalID=210|
When requesting a correction, please mention this item's handle: RePEc:ids:eujine:v:5:y:2011:i:1:p:64-80. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Graham Langley)
If references are entirely missing, you can add them using this form.