Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms
暂无分享,去创建一个
Arunachalam Narayanan | Powell Robinson | Powell E. Robinson | Funda Sahin | F. Sahin | A. Narayanan
[1] Stéphane Dauzère-Pérès,et al. Single item lot sizing problems , 2006, Eur. J. Oper. Res..
[2] Arthur F. Veinott,et al. Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems , 1969, Oper. Res..
[3] S. Selcuk Erenguc,et al. Multiproduct dynamic lot-sizing model with coordinated replenishments , 1988 .
[4] Curtis L. Stowers,et al. Lot sizing problems with strong set-up interactions , 1997 .
[5] Moncer Hariga,et al. Two New Heuristic Procedures for the Joint Replenishment Problem , 1994 .
[6] F. Toledo,et al. A network flow model for the capacitated lot-sizing problem , 1999 .
[7] Meir J. Rosenblatt,et al. On the economic ordering quantity for jointly replenished items , 1991 .
[8] Paul Iyogun,et al. A heuristic with lower bound performance guarantee for the multi-product dynamic lot-size problem , 1988 .
[9] Moncer Hariga,et al. Comparative study of heuristics for the joint replenishment problem , 1995 .
[10] Christos Koulamas,et al. A survey of simulated annealing applications to operations research problems , 1994 .
[11] Z. Michalewicz,et al. A comparison between genetic algorithms and the RAND method for solving the joint replenishment problem , 2000 .
[12] Hanif D. Sherali,et al. Convex envelope results and strong formulations for a class of mixed‐integer programs , 1996 .
[13] C.-H. Pan. Sensitivity analysis of dynamic lot-sizing heuristics , 1994 .
[14] Arunachalam Narayanan,et al. More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’ , 2006 .
[15] G. Laporte,et al. Models and algorithms for the dynamic-demand joint replenishment problem , 2004 .
[16] P. S. Eisenhut. A Dynamic Lot Sizing Algorithm with Capacity Constraints , 1975 .
[17] David F. Pyke,et al. Inventory management and production planning and scheduling , 1998 .
[18] M. Lambrecht,et al. Heuristic Procedures for the Single Operation, Multi-Item Loading Problem , 1979 .
[19] Alf Kimms,et al. Lot sizing and scheduling -- Survey and extensions , 1997 .
[20] Awi Federgruen,et al. Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems , 2007, Oper. Res..
[21] Edward A Silver,et al. Coordinated replenishments of items under time‐varying demand: Dynamic programming formulation , 1979 .
[22] Awi Federgruen,et al. The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions , 1994, Oper. Res..
[23] Ford W. Harris,et al. How Many Parts to Make at Once , 1990, Oper. Res..
[24] Suresh Kumar Goyal,et al. Joint replenishment inventory control: Deterministic and stochastic models , 1989 .
[25] Edward P. C. Kao,et al. A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs , 1979, Oper. Res..
[26] Harvey M. Wagner,et al. Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..
[27] Ranga V. Ramasesh. Lot-sizing decisions under limited-time price incentives: A review , 2010 .
[28] Ömer Kirca,et al. A primal‐dual algorithm for the dynamic lotsizing problem with joint set‐up costs , 1995 .
[29] S. Selcuk Erenguc,et al. A multifamily dynamic lot‐sizing model with coordinated replenishments , 1990 .
[30] Edmund Robinson,et al. Effective heuristics for the dynamic demand joint replenishment problem , 2007, J. Oper. Res. Soc..
[31] John M. Wilson,et al. A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over , 2006, J. Oper. Res. Soc..
[32] Arunachalam Narayanan,et al. Evaluation of joint replenishment lot-sizing procedures in rolling horizon planning systems , 2010 .
[33] Dong X. Shaw,et al. Complexity of the ELSP with general cyclic schedules , 1997 .
[34] Willard I. Zangwill,et al. A Deterministic Multiproduct, Multi-Facility Production and Inventory Model , 1966, Oper. Res..
[35] E. Arkin,et al. Computational complexity of uncapacitated multi-echelon production planning problems , 1989 .
[36] John M. Wilson,et al. The capacitated lot sizing problem: a review of models and algorithms , 2003 .
[37] Fokko ter Haseborg. On the optimality of joint ordering policies in a multi-product dynamic lot size model with individual and joint set-up costs , 1982 .
[38] Li-Lian Gao,et al. A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging , 1996 .
[39] R.E. Wildeman,et al. An efficient optimal solution method for the joint replenishment problem , 1997 .
[40] Dev Joneja,et al. The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds , 1990, Oper. Res..
[41] F. Barry Lawrence,et al. Coordinated Capacitated Lot-Sizing Problem with Dynamic Demand: A Lagrangian Heuristic , 2004, Decis. Sci..
[42] S. S. Erenguc,et al. Multi‐Item Inventory Models with Co‐ordinated Replenishments: A Survey , 1988 .
[43] Paul Iyogun,et al. Heuristic Methods for the Multi-product Dynamic Lot Size Problem , 1991 .
[44] W. Hsu. On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine , 1983 .
[45] N. Adam,et al. The Dynamic Lot-Sizing Problem for Multiple Items Under Limited Capacity , 1981 .
[46] S. Viswanathan,et al. A New Optimal Algorithm for the Joint Replenishment Problem , 1996 .