A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems
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....
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
World Scientific Publishing
2002
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/40415/1/A%20heuristic%20procedure%20for%20solving%20multi-plant%2C%20multi-item%2C%20multi-period%20capacitated%20lot-sizing%20problems.pdf |
| _version_ | 1825949597045882880 |
|---|---|
| author | Sambasivan, Murali Schmidt, Charles P. |
| author_facet | Sambasivan, Murali Schmidt, Charles P. |
| author_sort | Sambasivan, Murali |
| collection | UPM |
| description | 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. |
| first_indexed | 2024-03-06T08:47:00Z |
| format | Article |
| id | upm.eprints-40415 |
| institution | Universiti Putra Malaysia |
| language | English |
| last_indexed | 2024-03-06T08:47:00Z |
| publishDate | 2002 |
| publisher | World Scientific Publishing |
| record_format | dspace |
| spelling | upm.eprints-404152015-09-18T01:43:17Z http://psasir.upm.edu.my/id/eprint/40415/ A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems Sambasivan, Murali Schmidt, Charles P. 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. World Scientific Publishing 2002-05 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/40415/1/A%20heuristic%20procedure%20for%20solving%20multi-plant%2C%20multi-item%2C%20multi-period%20capacitated%20lot-sizing%20problems.pdf 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 |
| spellingShingle | Sambasivan, Murali Schmidt, Charles P. A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems |
| title | A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems |
| title_full | A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems |
| title_fullStr | A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems |
| title_full_unstemmed | A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems |
| title_short | A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems |
| title_sort | heuristic procedure for solving multi plant multi item multi period capacitated lot sizing problems |
| url | http://psasir.upm.edu.my/id/eprint/40415/1/A%20heuristic%20procedure%20for%20solving%20multi-plant%2C%20multi-item%2C%20multi-period%20capacitated%20lot-sizing%20problems.pdf |
| work_keys_str_mv | AT sambasivanmurali aheuristicprocedureforsolvingmultiplantmultiitemmultiperiodcapacitatedlotsizingproblems AT schmidtcharlesp aheuristicprocedureforsolvingmultiplantmultiitemmultiperiodcapacitatedlotsizingproblems AT sambasivanmurali heuristicprocedureforsolvingmultiplantmultiitemmultiperiodcapacitatedlotsizingproblems AT schmidtcharlesp heuristicprocedureforsolvingmultiplantmultiitemmultiperiodcapacitatedlotsizingproblems |