Drexl A, Kimms A. Lot sizing and scheduling-survey and extensions. European Journal of Operational Research, 1997, 99(2): 221-235
[2]
Bredstróm D, Lundgren J T, Rónnqvist M, Carlsson D, Mason A. Supply chain optimization in the pulp mill industry-IP models, column generation and novel constraint branches. European Journal of Operational Research, 2004, 156(1): 2-22
[3]
Lidestam H, Rónnqvist M. Use of Lagrangian decomposition in supply chain planning. Mathematical and Computer Modelling, 2011, 54(9-10): 2428-2442
[4]
Tang Li-Xin, Zhao Ren. A new enhanced-dynasearch & TS for the pickling-rolling scheduling problem. Acta Automatica Sinica, 2010, 36(2): 304-313 (唐立新, 赵任. 强化Dynasearch & TS 算法求解酸轧生产调度问题. 自动化学报, 2010, 36(2): 304-313)
[5]
Wang Gong-Shu, Tang Li-Xin. Modelling and optimization methods for the sequencing problem with batching decision in the continuous-casting and rolling production. Acta Automatica Sinica, 2012, 38(10): 1713-1720 (汪恭书, 唐立新. 连铸—轧制生产中带有批决策的排序问题的建模与优化方法. 自动化学报, 2012, 38(10): 1713-1720)
[6]
Chai Tian-You. Challenges of optimal control for plant-wide production processes in terms of control and optimization theories. Acta Automatica Sinica, 2009, 35(6): 641-649 (柴天佑. 生产制造全流程优化控制对控制与优化理论方法的挑战. 自动化学报, 2009, 35(6): 641-649)
[7]
Dantzig G B, Wolfe P. Decomposition principle for linear programs. Operations Research, 1960, 8(1): 101-111
[8]
Desaulniers G, Desrosiers J, Solomon M M. Column Generation. Berlin: Springer-Verlag, 2005
[9]
Restrepo M I, Lozano L, Medaglia A L. Constrained network-based column generation for the multi-activity shift scheduling problem. International Journal of Production Economics, 2012, 140(1): 466-472
[10]
Baldacci R, Mingozzi A, Roberti R. New route relaxation and pricing strategies for the vehicle routing problem. Operations Research, 2011, 59(5): 1269-1283
[11]
Staalhane M, Andersson H, Christiansen M, Cordeau J F, Desaulniers G. A branch-price-and-cut method for a ship routing and scheduling problem with split loads. Computers and Operations Research, 2012, 39(12): 3361-3375
[12]
Shapiro J F. Modeling the Supply Chain. Duxbury: Thomson Learning, 2001
[13]
van Hoesel S, Romeijn H E, Morales D R, Wagelmans A P M. Integrated lot sizing in serial supply chains with production capacities. Management Science, 2005, 51(11): 1706-1719
[14]
Carlsson D, Rónnqvist M. Supply chain management in forestry-case studies at Sódra Cell AB. European Journal of Operational Research, 2005, 163(3): 589-616
[15]
Gunnarsson H, Rónnqvist M. Solving a multi-period supply chain problem for a pulp company using heuristics——an application to Sódra Cell AB. International Journal of Production Economics, 2008, 116(1): 75-94
[16]
Zhao Yu-Fang, Tang Li-Xin. Scheduling with agreeable release times and due dates on a single continuous batch processing machine. Acta Automatica Sinica, 2008, 34(8): 957-963 (赵玉芳, 唐立新. 释放时间和工期同序的单机连续型批调度问题. 自动化学报, 2008, 34(8): 957-963)
[17]
Tang L X, Liu J Y, Rong A Y, Yang Z H. A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex. European Journal of Operational Research, 2000, 124(2): 267-282
[18]
Luo Zhi-Hong, Tang Li-Xin. Modeling and solution to integrated production and logistics planning of steel making and hot rolling. Journal of Management Sciences in China, 2011, 14(6): 16-23 (罗治洪, 唐立新. 炼钢热轧一体化生产与物流计划模型及求解. 管理科学学报, 2011, 14(6): 16-23)
[19]
Lübbecke M E, Desrosiers J. Selected topics in column generation. Operations Research, 2005, 53(6): 1007-1023
[20]
Desrosiers J, Soumis F, Desrochers M. Routing with time windows by column generation. Networks, 1984, 14(4): 545-565
[21]
de Queiroz T A, Miyazawa F K, Wakabayashi Y, Xavier E C. Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing. Computers and Operations Research, 2012, 39(2): 200-212
[22]
Baldacci R, Mingozzi A, Wolfler Calvo R. An exact method for the capacitated location-routing problem. Operations Research, 2011, 59(5): 1284-1296
[23]
Muter ī, Birbil S ī, Bülbül K, Sahin G, Yenigün H, Tas D, Tüzün D. Solving a robust airline crew pairing problem with column generation. Computers and Operations Research, 2013, 40(3): 815-830
