Citation
Sambasivan, Murali and Schmidt, Charles P.
(2002)
A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems.
Asia-Pacific Journal of Operational Research, 19 (1).
pp. 87-105.
ISSN 0217-5959; ESSN: 1793-7019
Abstract
This paper presents a heuristic procedure for solving multi-plant, multi-item, capacitated lot sizing problems with inter-plant transfers. The solution procedure uses the solution for the uncapacitated problem as a starting point. A smoothing routine has been employed to remove capacity violations. The smoothing routine consists of two modules. Extensive experimentation has been conducted comparing the heuristic solution procedure and LINDO. The heuristic has been implemented on IBM 3090 mainframe using FORTRAN.
Download File
![[img]](http://psasir.upm.edu.my/40415/1.hassmallThumbnailVersion/A%20heuristic%20procedure%20for%20solving%20multi-plant%2C%20multi-item%2C%20multi-period%20capacitated%20lot-sizing%20problems.pdf) ![](http://psasir.upm.edu.my/40415/1.haspreviewThumbnailVersion/A%20heuristic%20procedure%20for%20solving%20multi-plant%2C%20multi-item%2C%20multi-period%20capacitated%20lot-sizing%20problems.pdf) Preview |
|
PDF (Abstract)
A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems.pdf
Download (35kB)
| Preview
|
|
Additional Metadata
Actions (login required)
![View Item View Item](/style/images/action_view.png) |
View Item |