A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
- 1 March 2005
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 32 (3) , 537-555
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Facets and algorithms for capacitated lot sizingMathematical Programming, 1989
- Capacitated Lot Sizing with Setup TimesManagement Science, 1989
- Valid inequalities and separation for capacitated economic lot sizingOperations Research Letters, 1988
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable RedefinitionOperations Research, 1987
- Strong Formulations for Multi-Item Capacitated Lot SizingManagement Science, 1984
- Uncapacitated lot-sizing: The convex hull of solutions1984
- A heuristic solution procedure for the multi‐item, single‐level, limited capacity, lot‐sizing problemJournal of Operations Management, 1981
- A capacity constrained single-facility dynamic lot-size modelEuropean Journal of Operational Research, 1978
- A Dynamic Lot Sizing Algorithm with Capacity ConstraintsA I I E Transactions, 1975
- Dynamic Version of the Economic Lot Size ModelManagement Science, 1958