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

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

Preview

PDF (Abstract)
A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems.pdf
Download (35kB) | Preview

Additional Metadata

Item Type:	Article
Divisions:	Faculty of Economics and Management
Publisher:	World Scientific Publishing
Keywords:	Capacitated lot sizing; Heuristics; Multi-plant production planning
Depositing User:	Nabilah Mustapa
Date Deposited:	18 Sep 2015 01:43
Last Modified:	18 Sep 2015 01:43
URI:	http://psasir.upm.edu.my/id/eprint/40415
Statistic Details:	View Download Statistic

Actions (login required)

View Item