A Branch and Bound Algorithm for a Single-Item Multi-Source Dynamic Lot Sizing Problem with Capacity Constraints

References

• Blackburn , J. and Kunreutber H. , “ Planning Horizons for the Lot-Size Model with Backlogging ,” Management Science , 21 , 215 – 225 ( 1974 ).
   Web of Science ®Google Scholar
• Baker , K. R. , Dixon , P. , Magazine , M. J. and Silver , E. A. , “ An Algorithm for the Dynamic Lot Sizing Problem with Time-Varying Production Capacity Constraints ,” Management Science , 24 , 1710 – 1720 ( 1978 ).
   Google Scholar
• Bishop , G. T. , “ On a Problem of Production Scheduling ,” Operations Research , 5 , 97 – 103 ( 1957 ).
   Web of Science ®Google Scholar
• Bitran , G. R. and Yanasse , H. H. , “ Computational Complexity of the Capacitated Lot Size Problem ,” Management Science, 28 1174 1186 ( 1982 ).
   Web of Science ®Google Scholar
• Bowman , E. H. , “ Production Scheduling by the Transportation Method of Linear Programming ,” Operations Research , 4 , 100 – 103 ( 1956 ).
   Web of Science ®Google Scholar
• Busacker , R. G. and Gowen , P. J. , “ A Procedure for Determining a Family of Minimal-Cost Network Flow Patterns ,” Technical Paper 15, Operations Research Office, John Hopkins University , 1961 .
   Google Scholar
• Eppen , G. D. and Gould , F. J. , and Pashigian , B. P. , “ Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model ,” Management Science , 15 , 268 – 277 ( 1969 ).
   Web of Science ®Google Scholar
• Erengue , S. S. and Tufekei , S. , “ A Branch and Bound Algorithm for a Single-Item Multi-Source Dynamic Lot Sizing Problem with Capacity Constraints ,” Center for Econometrics and Decision Sciences, College of Business Administration, University of Florida, Discussion Paper, No. 128, 1986 .
   Google Scholar
• Erengue , S. S. and Tufekei , S. , “ A Transportation Type Aggregate Production Model with Bounds on Inventory and Backordering ,” Industrial and System Engineering Department, University of Florida , Research Report, No. 84–29, 1984 .
   Google Scholar
• Florian , M. and Klein , M. , “ Deterministic Production Planning with Concave Costs and Capacity Constraints ,” Management Science, 18 , 12 20 ( 1971 ).
   Web of Science ®Google Scholar
• Florian , M. , Lenstra , J. K. and Rinnooy-Kan , A. , “ Deterministic Production Planning Algorithms and Complexity ,” Management Science, 26 , 669 679 ( 1980 ).
   Web of Science ®Google Scholar
• Hu , T. C. , “ Minimum-Cost Flows in Convex-Cost Networks ,” Naval Research Logistics Quarterly , 13 , 1 – 9 ( 1969 ).
   Google Scholar
• Jagannathan , R. and Rao , M. R. , “ A Class of Deterministic Production Planning Problems ,” Management Science , 19 , 1295 – 1300 ( 1973 ).
   Google Scholar
• Johnson , S. M. , “ Sequential Production Planning Over Time at Minimum Cost ,” Management Science , 3 , 435 – 437 ( 1957 ).
   Web of Science ®Google Scholar
• Kennington , J. L. and Helgason , R. V. , Algorithms for Network Programming , John Wiley , New York , 1980 .
   Google Scholar
• Klein , M. , “ A Transportation Model for Production Planning with Convex Costs ,” AIIE Transactions , 15 , 272 – 274 ( 1983 ).
   Web of Science ®Google Scholar
• Kunreuther , H. and Morton T. , “ Planning Horizons for Production Smoothing with Deterministic Demands: I ,” Management Science , 20 , 110 – 125 ( 1973 ).
   Web of Science ®Google Scholar
• Kunreuther , H. and Morton T. , “ Planning Horizons for Production Smoothing with Deterministic Demands; II ”, Management Science , 20 , 1037 – 1046 ( 1974 ).
   Web of Science ®Google Scholar
• Lambrecht , M. and Vander Eecken , J. , “ A Capacity Constrained Single-Facility Dynamic Lot Size Model ,” Eur. J. Operational Res. , 2 , 132 – 136 ( 1978 ).
   Web of Science ®Google Scholar
• Love , S. F. , “ Bounded Production and Inventory Models with Piecewise Concave Costs ,” Management Science , 20 , 313 – 319 , ( 1973 ).
   Web of Science ®Google Scholar
• Lundin , R. and Morton , T. , “ Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results ,” Operations Research , 23 , 711 – 734 ( 1975 ).
   Web of Science ®Google Scholar
• Manne , A. , “ A Note on the Modigliani-Hohn Production Smoothing Model ,” Management Science , 3 , 371 – 379 ( 1957 ).
   Web of Science ®Google Scholar
• Posner , E. M. and Szwarc , W. , “ Transportation Type Aggregate Production Model with Backordering ,” Management Science , 29 , 188 – 199 ( 1983 ).
   Web of Science ®Google Scholar
• Sadleir , C. D. , “ Use of Transportation Method of Linear Programming in Production Planning: A Case Study ,” Operations Research Quarterly , 21 , 393 – 402 ( 1970 ).
   Google Scholar
• Swoveland , C. , “ A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs ,” Management Science , 21 , 1007 – 1013 ( 1975 ).
   Web of Science ®Google Scholar
• Veinott , A. F. , Jr , “ Production Planning with Convex Costs: A Parametric Study ,” Management Science , 10 , 441 – 460 ( 1964 ).
   Web of Science ®Google Scholar
• Wagner , H. M. and Whitin , T. , “ Dynamic Version of the Economic Lot Size Model ,” Management Science , 5 , 89 – 96 , ( 1958 ).
   Web of Science ®Google Scholar
• Zabel , E. , “ Some Generalizations of an Inventory Planning Horizon Theorem ,” Management Science , 10 , 465 – 471 ( 1964 ).
   Web of Science ®Google Scholar
• Zangwill , W. , “ A Backlogging Model and a Multi-Echelon Model of a Dynamic Lot Size Production System: A Network Approach ,” Management Science , 15 , 506 – 527 ( 1969 ).
   Web of Science ®Google Scholar