A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems
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....
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
World Scientific Publishing
2002
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/40415/1/A%20heuristic%20procedure%20for%20solving%20multi-plant%2C%20multi-item%2C%20multi-period%20capacitated%20lot-sizing%20problems.pdf http://psasir.upm.edu.my/id/eprint/40415/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|