Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10348525 | Computers & Operations Research | 2005 | 19 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Murali Sambasivan, Salleh Yahya,