Simple Search:

A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers


Citation

Sambasivan, Murali and Yahya, Salleh (2005) A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers. Computers & Operations Research, 32 (3). pp. 537-555. ISSN 0305-0548; ESSN: 1873-765X

Abstract / Synopsis

This paper addresses scheduling of lot sizes in a multi-plant, multi-item, multi-period, capacitated environment with inter-plant transfers. A real-world problem in a company manufacturing steel rolled products provided motivation to this research. A Lagrangean-based approach, embedded with a lot shifting–splitting–merging routine, has been used for solving the multi-plant, capacitated lot-sizing problem. A “good” solution procedure developed by Sambasivan (Ph.D. Dissertation, University of Alabama, Tuscaloosa, 1994) has been used for solving the relaxed problem. About 120 randomly generated instances of the problem have been solved and it has been found that Lagrangean-based approach works quite “efficiently” for this problem.


Download File

[img]
Preview
PDF (Abstract)
A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers.pdf

Download (49kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Graduate School of Management
DOI Number: https://doi.org/10.1016/j.cor.2003.08.002
Publisher: Elsevier
Keywords: Capacitated lot sizing; Lagrangean-based heuristic; Multi-plant production planning
Depositing User: Nabilah Mustapa
Date Deposited: 14 Sep 2015 08:27
Last Modified: 14 Sep 2015 08:27
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1016/j.cor.2003.08.002
URI: http://psasir.upm.edu.my/id/eprint/40149
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item