A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems

A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems

0.00 Avg rating0 Votes
Article ID: iaor20032658
Country: Singapore
Volume: 19
Issue: 1
Start Page Number: 87
End Page Number: 105
Publication Date: May 2002
Journal: Asia-Pacific Journal of Operational Research
Authors: ,
Keywords: heuristics, planning
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.

Reviews

Required fields are marked *. Your email address will not be published.