Lagrangean Relaxation for the Multi-Item Capacitated Lot-Sizing Problem: A Heuristic Implementation

References

• Bahl , H. C. and Zionts , S. , “ Multi-Item Scheduling by Benders Decomposition ”, Working Paper No. 522, School of Management, State University of New York at Buffalo , Buffalo , N.Y. 14214, 1983 .
   Google Scholar
• Barany , I. , Van Roy T. J. and Wolsey , L. , A. , “ Strong formulations for the multi-item capacitated lot-sizing problem ”, CORE Report, C.O.R.E., Universite Catholique de Louvain , Belgium , 1983 .
   Google Scholar
• Benders , J. F. , “ Partitioning Procedures for Solving Mixed-Variables Programming Problems ”, Numerische Mathematik , 4 , 1962 , pp. 238 – 252 .
   Google Scholar
• Bowman , E. H. , “ Production scheduling by the transportation method of linear programming ”, Operations Research , 4 , 1956 , pp. 100 – 103 .
   Web of Science ®Google Scholar
• Charnes , A. and Cooper , W. , W. , “ Management Models and Industrial Applications of Linear Programming, vol. II ”, John Wiley and Sons , New York , 1961 .
   Google Scholar
• Dixon , P. , “ Multi-item lot-sizing with limited capacity ”, Ph.D. Thesis , University of Waterloo , Waterloo , Ontario , 1979 .
   Google Scholar
• Dixon , P. and Silver , E. , A. , “ A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem ”, Journal of Operations Management , 2 ( 1 ), 1981 , pp. 23 – 39 .
   Google Scholar
• Dogramaei A. , Panayiotopoulos , J. , C. and Adam , N. , R. , “ The dynamic lot-sizing problem for multiple items under limited capacity ”, AIIE Transactions , 13 ( 4 ), 1981 , pp. 295 – 303 .
   Google Scholar
• Dzielinski , B. and Gomory , R. , “ Optimal programming of lot-sizes, inventories, and labor allocations ”, Management Science , 11 ( 9 ), 1965 , pp. 874 – 890 .
   Web of Science ®Google Scholar
• Eisenhut , P. S. , “ A dynamic lot-sizing algorithm with capacity constraints ”, AIIE transactions , 7 ( 2 ), 1975 , pp. 170 – 176 .
   Google Scholar
• Gavish , B. “ Formulations and algorithms for the capacitated minimal directed tree Problem ”, Journal of the Association for Computing Machinery , 30 ( 1 ), 1983 , pp. 118 – 132 .
   Web of Science ®Google Scholar
• Glover , F. , Hultz , J. , Klingman , D. and Stutz , J. , “ Generalized Networks: a Fundamental Computer-Based Planning Tool ”, Management Science , 24 ( 12 ), 1978 , pp. 1209 – 1220 .
   Web of Science ®Google Scholar
• Graves , S. C. , “ Using Lagrangian Techniques to Solve Hierarchical Production Planning Systems ”, Management Science , 28 ( 3 ), 1982 , pp. 260 – 275 .
   Web of Science ®Google Scholar
• Held , M. , Wolfe , P. and Crowder , H. , P. , “ Validation of Subgradient Optimization ”, Mathematical Programming , 6 , 1974 , pp. 62 – 88 .
   Google Scholar
• Hitchcock , F. L. , “ The distribution of a product from several sources to numerous localities ”, Journal of Mathematics and Physics , 20 ( 3 ), 1941 , pp. 224 – 230 .
   Google Scholar
• Karmarkar , U. S. and Schrage , L. , E. , “ The Deterministic Dynamic Product Cycling Problem ”, Working Paper 8126, Graduate School of Management, University of Rochester , 1981 , to appear in Operations Research.
   Google Scholar
• Karni , R. and Roll , Y. , “ A heuristic algorithm for the multi-item lot-sizing problem with capacity constraints ”, IEE Transactions , 14 ( 4 ), 1982 , pp. 249 – 256 .
   Web of Science ®Google Scholar
• Kleindorfer , P. R. and Newson , E. , F. P. , “ A lower bound structure for lot-size scheduling problems ”, Operations Research , 23 ( 2 ), 1975 , pp. 299 – 311 .
   Web of Science ®Google Scholar
• Krarup , J. and Bilde , O. , “ Plant Location, Set Covering and Economic Lot Size: An O(mn) Algorithm for Structural Problems ”, Technical Report, 1977 .
   Google Scholar
• Lambrecht , M. R. and Vanderveken , H. , “ Heuristic procedures for the single operation, multi-item loading problem ”, AIIE Transactions , 2 ( 4 ), 1979 , pp. 319 – 326 .
   Google Scholar
• Lasdon , L. S. , “ Optimization Theory for Large-Scale Systems ”, Macmillan Publishing Co. , New York , 1970 .
   Google Scholar
• Lasdon , L. S. and Terjung , R. , C. , “ An efficient algorithm for multi-item scheduling ”, Operations Research , 19 ( 4 ), 1971 , pp. 946 – 969 .
   Web of Science ®Google Scholar
• Manne , A. S. , “ Programming of Economic Lot sizes ”, Management Science , 4 ( 2 ), 1958 , pp. 115 – 135 .
   Web of Science ®Google Scholar
• Newson , E. F. P. , “ Multi-item lot-size scheduling by heuristic, part 1: with fixed resources ”, Management Science , 21 ( 10 ), 1975 , pp. 1186 – 1193 .
   Web of Science ®Google Scholar
• Sijombalapitiya , P. , “ Greedy heuristics for the multi-item dynamic lot-size problem ”, Ph.D. Thesis , University of Newcastle , Australia , 1983 .
   Google Scholar
• Srinivasan , V. and Thompson , G. , L. , “ Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm ”, Journal of the Association for Computing Machinery , 20 , 1973 , pp. 194 – 213 .
   Web of Science ®Google Scholar
• VanNunen , J. and Wessels , J. , “ Multi-item lot size determination and scheduling under capacity constraints ”, European Journal of Operational Research , 2 ( 1 ), 1978 , pp. 36 – 41 .
   Web of Science ®Google Scholar
• Wagner , H. , M. and Whitin , T. , “ Dynamic version of the economic lot sizing model ”, Management Science , 5 ( 3 ), 1958 , pp. 89 – 96 .
   Web of Science ®Google Scholar
• Zangwill , W. I. , “ Minimum concave cost flows in certain networks ”, Management Science , 14 ( 7 ), 1968 , pp. 429 – 450 .
   Web of Science ®Google Scholar