Zhang T, Zhang Y J, Zheng Q P, et al. A hybrid particleswarm optimization and tabu search algorithm for order planning problems of steel factories based on the make-to-stock and make-to-order management architecture[J]. J of Industrial and Management Optimization, 2011, 7(1): 31-51.
[2]
Hanafi S, Freville A. An efficient tabu search approach for the 0-1 multidimensional knapsack problem[J]. European J of Operational Research, 1998, 106(2/3): 659-675.
[3]
Glover F. Heuristics for integer programming using surrogate constraints[J]. Decision Sciences, 1977, 8(1): 156-166.
[4]
MartíR, Laguna M, Glover F. Principles of scatter search[J]. European J of Operational Research, 2006, 169(2): 359-372.
[5]
Scheuerer S, Wendolsky R. A scatter search heuristic for the capacitated clustering problem[J]. European J of Operational Research, 2006, 169(2): 533-547.
[6]
Zamani R. An accelerating two-layer anchor search with application to the resource-constrained project scheduling problem[J]. IEEE Trans on Evolutionary Computation, 2010, 14(6): 975-984.
[7]
Russell R A, Chiang W C. Scatter search for the vehicle routing problem with time windows[J]. European J of Operational Research, 2006, 169(2): 606-622.
[8]
Nowicki E, Smutnicki C. Some aspects of scatter search in the flow-shop problem[J]. European J of Operational Research, 2006, 169(2): 654-666.
[9]
Kalagnanam J R, Dawande M W, Trumbo M, et al. The surplus inventory matching problem in the process industry[J]. Operations Research, 2000, 48(4): 505-516.
[10]
Balakrishnan A, Genunes J. Production planning with flexible product specifications: An application to specialty steel manufacturing[J]. Operations Research, 2003, 51(1): 94-112.
[11]
Dawande M, Kalagnanam J, Lee H S, et al. The slab-design problem in the steel industry[J]. Interfaces, 2004, 34(3): 215-225.
[12]
Forrest J J H, Kalagnanam J, Ladanyi L. A column-generation approach to the multiple knapsack problem with color constraints[J]. Informs J on Computing, 2006, 18(1): 129-134.
[13]
Yanagisawa H. The material allocation problem in the steel industry[J]. IBM J of Research and Development, 2007, 51(3/4): 363-374.
[14]
Tang L X, Luo J X, Liu J Y. Modelling and a tabu search solution for the slab allocation problem in the steel industry[J]. Int J of Production Research, 2013, 51(14): 4405-4420.
[15]
Song S H. A nested column generation algorithm to the meta slab allocation problem in the steel making industry[J]. Int J of Production Research, 2009, 47(13): 3625-3638.
(Tian Z B, Tang L X, Ren Y M, et al. Solving open-order slab matching problem by ACO with compound neighborhood[J]. Acta Automatica Sinica, 2009, 35(2): 186-192.)
[18]
Huang X L, Hu K Y, Li H Y, et al. Mathematical programming model and algorithms for production planning with considering slab matching[C]. Proc of the 2nd Int Conf on Machine Learning and Cybernetics. Xi’an: IEEE Conference Publications, 2003: 2055-2060.
