Yanasse H H, Senne E L F. The minimization of open stacks problem: a review of some properties and their use in pre-processing operations[J]. European Journal of Operational Research, 2010, 203: 559-567.
[5]
Yanasse H H, Lamosa D M. An integrated cutting stock and sequencing problem[J]. European Journal of Operational Research, 2007, 183: 1353-1370.
[6]
Chandra P, Fisher M L. Coordination of production and distribution planning[J]. European Journal of Operational Research, 1994, 72:503-517.
[7]
Ertogral K. Multi-item single source ordering problem with transportation cost: Lagrangian decomposition approach[J]. European Journal of Operational Research, 2008, 191: 156-165.
[8]
Chan F T S, Chung S H, Wadhwa S A. hybrid genetic algorithm for production and distribution [J]. Omega, 2005, 33: 345-355.
[9]
Gen M, Syarif A. Hybrid genetic algorithm for multi-time period production/distribution planning[J].Computers & Industrial Engineering, 2005, 48: 799-809.
[10]
Qu W W, Bookbinder J H, Iyogun P. An integrated inventory-transportation system with modified periodic policy for multiple products [J]. European Journal of Operational Research, 1999, 115: 254-269.
[11]
Zhou S X, Chao Xiuli, Lee C Y. Optimal transportation policies for production/inventory systems with an unreliable and a reliable carrier [J]. Journal of Global Optimization, 2009, 44: 251-271.
[12]
Bard J F, Nananukul N. A branch-and-price algorithm for an integrated production and inventory routing problem[J]. Computers & Operations Research, 2010, 37: 2202-2217.
[13]
Fumero F, Vercellis C. Synchronized development of production, inventory, and distribution schedules[J]. Transportation Science, 1999, 33(3): 330-340.
[14]
Erjavec J, Gradisar M, Trkman P. Assessment of stock size to minimize cutting stock production costs[J]. International Journal of Production Economics, 2012, 135: 170-176.
[15]
Wongprakornkul S, Charnsethikul P. Optimization based heuristic approaches for solving an integrated one-dimensional cutting stock-transportation problem[J]. Journal of Mathematics and Statistics, 2007, 3: 142-150.
[16]
Fisher M L. The Lagrangian relaxation method for solving integer programming problems [J]. Management Science, 1981, 27(1):1-18.
[17]
Held M, Wolfe P, Crowder H P. Validation of subgradient optimization [J]. Mathematical Programming, 1974, 6 (1): 62-88.
[18]
Gau T, Wa？scher G. CUTGEN1: A problem generator for the Standard one-dimensional cutting stock problem[J].European Journal of Operational Research, 1995, 84: 572-579.
