Two-staged guillotine cut, two-dimensional bin packing optimisation with flexible bin size for steel mother plate design

International Journal of Production Research

Volumn 48, Issue 22, 2010, Pages 6799-6820

  Wy, Juyoung ^a   Kim, Byung In ^a  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

bin packing problem; cutting stock problem; heuristics; steel mother plate design

Indexed keywords

BENCH-MARK PROBLEMS; BIN PACKING; BIN PACKING PROBLEM; BIN SIZE; COMPUTATIONAL RESULTS; CUSTOMER ORDERS; CUTTING STOCK PROBLEM; HEURISTICS; OPTIMISATIONS; PLATE DESIGN; PRODUCTION COST; ROLLING PROCESS; WORK IN PROCESS;

BINS; CUTTING; DESIGN; HEURISTIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; TWO DIMENSIONAL;

PROBLEM SOLVING;

EID: 77956907828     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540903317523     Document Type: Article

References (24)

1. Cintra, C.F., Miyazawa, F.K., and Wakabayashi, Y., 2008. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, 191 (1), 51-85.
2. Coffman, E.G., Garey, M.R., and Johnson, D.S., 1997. Approximation algorithm for bin packing: a survey. In: D. Hochbaum, ed. Approximation algorithm for NP-hard problems. Boston, MA: PWS Publishing, 46-93.
3. Correia, I., Gouveia, L., and Saldanha-Da-Gama, F., 2008. Solving the variable size bin packing problem with discretized formulations. Computers & Operations Research, 35 (6), 2103-2113.
4. Dash, S., et al, 2007. Production design for plate products in the steel industry. IBM Journal of Research & Development, 51 (3/4), 345-362.
5. Dutta, G. and Fourer, R., 2001. A survey of mathematical programming applications in integrated steel plants. Manufacturing & Service Operations Management, 3 (4), 387-400.
6. Edmonds, J., 1965. Maximum matching and a polyhedron with 0.1 vertices. Journal of Research of the National Bureau of Standards, 69B, 125-130.
7. Fritsch A. and Vornberger, O. 1995. Cutting stock by iterated matching. In: U. Derigs, A. Bachem, A. Drexl (eds.) Operations research proceedings, selected papers of the international conference on OR 94, Springer Verlag, 92-97.
8. Gilmore, P.C. and Gomory, R.E., 1965. Multistage cutting stock problems of two and more dimensions. Operations Research, 13 (1), 94-120.
9. Harjunkoski, I., et al, 1997. Different strategies for solving bilinear integer non-linear programming problems with convex transformations. Computers & Chemical Engineering, 21 (SUPPLE. 1), S487-S492.
10. ILOG Inc., (2007). ILOG CPLEX 11.0 Documentation.
11. Lee, H.S., et al, 1996. Primary production scheduling at steelmaking industries. IBM Journal of Research & Development, 40 (2), 231-252.
12. Lodi, A., Martello, S., and Monaci, M., 2002. Two-dimensional packing problems: a survey. European Journal of Operational Research, 141 (2), 241-252.
13. Lodi, A., Martello, S., and Vigo, D., 1999. Heuristic and metaheuristic approaches for a class of two-dimensional packing problems. INFORMS Journal on Computing, 11 (4), 345-357.
14. Lodi, A. and Monaci, M., 2003. Integer linear programming models for 2-staged two-dimensional Knapsack problems. Mathematical Programming, 94 (2-3), 257-278.
15. Morabito, R. and Arenales, M.N., 1996. Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach. European Journal of Operational Research, 94 (3), 548-560.
16. Park, S., (2007). Two-dimensional bin packing problems in steel industry. Thesis (PhD). Pohang University of Science and Technology (POSTECH), Korea.
17. Pisinger, D. and Sigurd, M., 2005. The two-dimensional bin packing problem with variable bin sizes and costs. Discrete Optimization, 2 (2), 154-167.
18. Polyakovsky, S. and M'Hallah, R., 2009. An agent-based approach to the two-dimensional guillotine bin packing problem. European Journal of Operational Research, 192 (3), 767-781.
19. Scholl, A., Klein, R., and Jurgens, C., 1997. BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research, 24 (7), 627-645.
20. Vasko, F.J., 1989. A computational improvement to Wang's two-dimensional cutting stock problem. Computers & Industrial Engineering, 16 (1), 109-115.
21. Vasko, F.J., Wolf, F.E., and Stott, K.L., 1989. A practical solution to a fuzzy two-dimensional cutting stock problem. Fuzzy Sets and Systems, 29 (3), 259-275.
22. Wang, P.Y., 1983. Two algorithms for constrained two-dimensional cutting stock problems. Operations Research, 31 (3), 573-586.
23. Yanasse, H.H. and Morabito, R., 2006. Linear models for 1-group two-dimensional guillotine cutting problems. International Journal of Production Research, 44 (17), 3471-3491.
24. Yanasse, H.H. and Morabito, R., 2008. A note on linear models for two-group and three-group two-dimensional guillotine problems. International Journal of Production Research, 46 (21), 6189-6206.