A heuristic procedure for a single-item dynamic lot sizing problem
暂无分享,去创建一个
[1] M. Rao,et al. A Class of Deterministic Production Planning Problems , 1973 .
[2] S. Selcuk Erenguc,et al. A branch and bound algorithm for a single-item multi-source dynamic lot sizing problem with capacity constraints , 1987 .
[3] A. F. Veinott. Production Planning with Convex Costs: A Parametric Study , 1964 .
[4] Wlodzimierz Szwarc,et al. A Transportation Type Aggregate Production Model with Backordering , 1983 .
[5] R. J. Tersine. Principles of inventory and materials management , 1982 .
[6] S. Selçuk Erengüç,et al. A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints , 1990, Comput. Oper. Res..
[7] John J. DeMatteis. An Economic Lot-Sizing Technique I: The Part-Period Algorithm , 1968, IBM Syst. J..
[8] E. H. Bowman. Production Scheduling by the Transportation Method of Linear Programming , 1956 .
[9] S. Axsäter. Worst case performance for lot sizing heuristics , 1982 .
[10] Joseph D. Blackburn,et al. HEURISTIC LOT‐SIZING PERFORMANCE IN A ROLLING‐SCHEDULE ENVIRONMENT* , 1980 .
[11] E. Silver,et al. Two Modifications Of The Silver-Meal Lot Sizing Heuristic , 1984 .
[12] George T. Bishop. On a Problem of Production Scheduling , 1957 .
[13] M. Florian,et al. DETERMINISTIC PRODUCTION PLANNING WITH CONCAVE COSTS AND CAPACITY CONSTRAINTS. , 1971 .
[14] Selmer M. Johnson,et al. Sequential Production Planning Over Time at Minimum Cost , 1957 .
[15] S. Selcuk Erenguc,et al. A transportation type aggregate production model with bounds on inventory and backordering , 1988 .
[16] L. Zurich,et al. Operations Research in Production Planning, Scheduling, and Inventory Control , 1974 .