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

Authors:
Murali Sambasivan;Salleh Yahya
Affiliations:
Graduate School of Management, Universiti Putra Malaysia, 43400 UPM, Serdang, Selangor, Malaysia;Graduate School of Management, Universiti Putra Malaysia, 43400 UPM, Serdang, Selangor, Malaysia
Venue:
Computers and Operations Research
Year:
2005

Citing 7
Cited 6

A strongly polynomial minimum cost circulation algorithm

Combinatorica
Solving multi-item capacitated lot-sizing problems using variable redefinition

Operations Research
Capacitated lot sizing with setup times

Management Science
Facets and algorithms for capacitated lot sizing

Mathematical Programming: Series A and B
Analysis of relaxations for the multi-item capacitated lot-sizing problem

Annals of Operations Research
A modified genetic algorithm for single machine scheduling

Computers and Industrial Engineering
Manufacturing 2: shop scheduling using Tabu search and simulation

Proceedings of the 34th conference on Winter simulation: exploring new frontiers

Optimization of production plan through simulation techniques

WSEAS Transactions on Information Science and Applications
A modified particle swarm optimization for production planningproblems in the TFT Array process

Expert Systems with Applications: An International Journal
Annual production budget in the beverage industry

Engineering Applications of Artificial Intelligence
MIP formulations and heuristics for two-level production-transportation problems

Computers and Operations Research
The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine

Information Sciences: an International Journal
A Lagrangean heuristic for a two-echelon storage capacitated lot-sizing problem

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.