A polynomial algorithm for a lot-sizing problem with backlogging, outsourcing and limited inventory
暂无分享,去创建一个
[1] Alper Atamtürk,et al. Capacity Acquisition, Subcontracting, and Lot Sizing , 2001, Manag. Sci..
[2] Albert P. M. Wagelmans,et al. An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem , 2006, Comput. Oper. Res..
[3] K. R. Baker,et al. An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints , 1978 .
[4] Joaquin Sicilia,et al. A new characterization for the dynamic lot size problem with bounded inventory , 2003, Comput. Oper. Res..
[5] Gq Huang,et al. Computers & Industrial Engineering , 2015 .
[6] Dong X. Shaw,et al. An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs , 1998 .
[7] Safia Kedad-Sidhoum,et al. Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales , 2011 .
[8] M. Florian,et al. DETERMINISTIC PRODUCTION PLANNING WITH CONCAVE COSTS AND CAPACITY CONSTRAINTS. , 1971 .
[9] Feng Chu,et al. Polynomial Algorithms for Single-Item Lot-Sizing Models With Bounded Inventory and Backlogging or Outsourcing , 2007, IEEE Transactions on Automation Science and Engineering.
[10] Albert P. M. Wagelmans,et al. Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems , 2001, Math. Oper. Res..
[11] C. Swoveland. A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs , 1975 .
[12] Joaquin Sicilia,et al. An efficient approach for solving the lot-sizing problem with time-varying storage capacities , 2008, Eur. J. Oper. Res..
[13] T. Morton. Note—An Improved Algorithm for the Stationary Cost Dynamic Lot Size Model with Backlogging , 1978 .
[14] W. Zangwill. A Deterministic Multi-Period Production Scheduling Model with Backlogging , 1966 .
[15] G. Bitran,et al. Computational Complexity of the Capacitated Lot Size Problem , 1982 .
[16] Suresh Chand,et al. The single-item lot-sizing problem with immediate lost sales , 2003, Eur. J. Oper. Res..
[17] A. Federgruen,et al. A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0n log n or 0n Time , 1991 .
[18] Deniz Aksen,et al. Loss of customer goodwill in the uncapacitated lot-sizing problem , 2007, Comput. Oper. Res..
[19] Joaquin Sicilia,et al. A polynomial algorithm for the production/ordering planning problem with limited storage , 2007, Comput. Oper. Res..
[20] Eugeniusz Toczyłowski. An O(T/sup 2/) algorithm for the lot-sizing problem with limited inventory levels , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.
[21] Harvey M. Wagner,et al. Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..
[22] Sotirios Papachristos,et al. The Single-Product Lot-Sizing Problem with Constant Parameters and Backlogging: Exact Results, a New Solution, and All Parameter Stability Regions , 2005, Oper. Res..
[23] Chien-Hua M. Lin,et al. An OT2 Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem , 1988 .
[24] Stephen F. Love. Bounded Production and Inventory Models with Piecewise Concave Costs , 1973 .
[25] Rolf A. Lundin,et al. Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results , 1975, Oper. Res..
[26] M. Rao,et al. A Class of Deterministic Production Planning Problems , 1973 .
[27] Chung-Yee Lee,et al. A new dynamic programming algorithm for the single item capacitated dynamic lot size model , 1994, J. Glob. Optim..
[28] A. F. Veinott. Production Planning with Convex Costs: A Parametric Study , 1964 .
[29] J. K. Lenstra,et al. Deterministic Production Planning: Algorithms and Complexity , 1980 .
[30] Albert P. M. Wagelmans,et al. An $O(T^3)$ algorithm for the economic lot-sizing problem with constant capacities , 1993 .
[31] Bing Lin,et al. Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in O(N log N) time , 2011, Comput. Oper. Res..
[32] Albert P. M. Wagelmans,et al. Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case , 1992, Oper. Res..
[33] Awi Federgruen,et al. A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n logn) or , 1991 .
[34] Alper Atamtürk,et al. Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation , 2005, Oper. Res..
[35] Wilco van den Heuvel,et al. Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities" , 2008, Eur. J. Oper. Res..
[36] H. Kunreuther,et al. Planning Horizons for the Dynamic Lot Size Model with Backlogging , 1974 .
[37] Gerald L. Thompson,et al. A Forward Algorithm for the Capacitated Lot Size Model with Stockouts , 1990, Oper. Res..
[38] Alok Aggarwal,et al. Improved Algorithms for Economic Lot Size Problems , 1993, Oper. Res..
[39] Gerald L. Thompson,et al. Decision horizons for the capacitated lot size model with inventory bounds and stockouts , 1993, Comput. Oper. Res..