Zangwill W I. A deterministic multi-period production scheduling model with backlogging [J]. Management Science, 1966, 13(1): 105–119.
[2]
(Huang L, Zhong J H, Yang Shan L. Single Item Lot Sizing Models with Backlogging and Outsourcing and Non-decreasing Inventory Capacity [J]. System Engineering –Theory & Practice, 2007, 27 (9): 87-96)
[3]
Wolsey L A. Progress with single-item lot-sizing [J]. European Journal of Operational Research, 1995, 86: 395–401.
[4]
Wolsey L A. Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation [J]. Management Science, 2002, 48(12): 1587–1602.
[5]
(Xie J X. New Developments of Mathematical Models and Algorithms of Economics Lotsizing and Scheduling Problems (ELSP)[J]. Operations Research and Management Science, 1995, 4(1):44–50.)
[6]
Lee CY, ?etinkaya S, Wagelmans A P M. A dynamic lot-sizing model with demand time windows [J], Management Science. 2001, 47(10):1384–1395.
[7]
Dauzère-Pérès S, Brahimi N, Najid N M, Nordli A. Uncapacitated lot-sizing problems with Time Windows [R]. Technical report, Ecole des Mines de Nantes, 2005.
[8]
Brahimi N, Dauzère-Pérès S, Najid N M. Capacitated multi-item lot-sizing problems with time windows [J]. Operations Research, 2006, 54(5): 951–967.
[9]
Wolsey LA. Lot-sizing with production and delivery time windows [J]. Mathematical Programming, 2006, Ser. A 107:471–489.
(Tang L X, Yang Z H, Wang M G. A New Algorithm of the CSLLSP in CIMS [J]. Control Theory and Applications,1999，16(2):213–216.)
[13]
Dantzig G B, Wolfe P. Decomposition principle for linear programs [J]. Operations Research, 1960, 8:101–111.
[14]
Lübbecke M E, Desrosiers J. Selected Topics in Column Generation [J], Operations Research, 2005, 53(6):1007–1023.
[15]
Degraeve Z, Jans R. A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times. Operations Research[J], 2007,55(5): 909–920.
[16]
Vanderbeck F. On Dantzig-Wolfe Decomposition in Integer Programming and Ways to Perform Branching in a Branch –and-Price Algorithm [J]. Operations Research, 2000, 48(1):111–128.
[17]
Zangwill W I. A backlogging model and a multi-echelon model of a dynamic economic lot size production system-a net work approach [J]. Management Science, 1969, 15(9):506–527.
[18]
Wagner H M, Whitin T M. Dynamic version of the economic lot size model [J]. Management Science, 1958, 5(1): 89–96.
[19]
Kü?ükyavuz S, Pochet Y. Uncapacitated lot sizing with backlogging: the convex hull [J]. Mathematical Programming, 2009, 118:151–175.
(Dai D M. Hybrid Algorithm for Capacitated Lot Sizing Problems in Price-Sensitive Demand [J]. Journal of System Simulation, 2009, 21(3):809-813.)
[23]
谢金星. 批量问题的数学模型与算法进展[J].运筹与管理, 1995, 4(1):44–50.
[24]
Hwang H C, Jaruphongsa W. Dynamic lot-sizing model with demand time windows and speculative cost structure [J]. Operations Research Letters, 2006, 34: 251–256.
[25]
Trigeiro W, Thomas LJ, McClain JO. Capacitated lot sizing with set-up times. Management Science, 1989,35(3):353–366
[26]
(Han Y, Tang J F, Wang L Y, et al. A Memetic Algorithm for Single Level Capacitated Lot-Sizing Problems[J]. Journal of Northeastern University (Natural Science), 2009, 30(8): 1111-1114. )
[27]
Barnhart C, Johnson E L, Nemhauser G L, Savelsbergh M W P and Vance P H. Brahch-and-Price: Column Generation for Solving Huge Integer Programs [J], Operations Research,1998, 46(3):316–329.
