320
Views
7
CrossRef citations to date
0
Altmetric
Original Articles

A two-dimensional bin packing problem with size changeable items for the production of wind turbine flanges in the open die forging industry

, &
Pages 1332-1344 | Received 01 Dec 2011, Accepted 01 Aug 2012, Published online: 29 Jul 2013

References

  • Balakrishnan , A. and Geunes , J. 2003 . Production planning with flexible product specifications: an application to specialty steel manufacturing . Operations Research , 51 ( 1 ) : 94 – 112 .
  • Berkey , J. O. and Wang , P. Y. 1987 . Two-dimensional finite bin-packing algorithms . The Journal of the Operational Research Society , 38 ( 5 ) : 423 – 429 .
  • Caprara , A. and Monaci , M. 2004 . On the two-dimensional knapsack problem . Operations Research Letters , 32 ( 1 ) : 5 – 14 .
  • 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 .
  • Fritsch , A. and Vornberger , O. 1995 . “ Cutting stock by iterated matching ” . In Proceedings of the International Conference on Operations Research 1994 , 92 – 97 . Springer Verlag, Berlin .
  • Garey , G. R. and Johnson , D. S. 1978 . “Strong” NP-completeness result: motivation, examples, and implications . Journal of the Association for Computing Machinery , 25 ( 3 ) : 499 – 508 .
  • Gilmore , P. C. and Gomory , R. E. 1965 . Multistage cutting stock problems of two and more dimensions . Operations Research , 13 : 94 – 120 .
  • Huang , W. and Chen , D. 2007 . A new heuristic algorithm for rectangle packing . Computers and Operations Research , 34 : 3270 – 3280 .
  • Imreh , C. 2001 . Online strip packing with modifiable boxes . Operations Research Letters , 29 : 79 – 85 .
  • Kim , B. and Wy , J. 2010 . Last two fit augmentation to the well-known construction heuristics for one-dimensional bin packing problem: an empirical study . International Journal of Advanced Manufacturing Technology , 50 ( 9–12 ) : 1145 – 1152 .
  • Kröger , B. 1995 . Guillotineable bin packing: a genetic approach . European Journal of Operational Research , 84 : 645 – 661 .
  • 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 .
  • Lodi , A. , Martello , S. and Vigo , D. 2002 . Recent advances in two-dimensional bin packing problems . Discrete Applied Mathematics , 123 : 379 – 396 .
  • Martello , S. and Vigo , D. 1998 . Exact solution of the two-dimensional finite bin packing problem . Management Science , 44 ( 3 ) : 388 – 399 .
  • Park , S. 2007 . “ Two-dimensional bin packing problems in steel industry ” . Korea : Ph.D. Thesis, Pohang University of Science and Technology (POSTECH) .
  • Pisinger , D. and Sigurd , M. 2005 . The two-dimensional bin packing problem with variable bin sizes and costs . Discrete Optimization , 2 ( 2 ) : 154 – 167 .
  • Rainwater , C. , Geunes , J. and Romeijn , E. 2009 . The generalized assignment problem with flexible jobs . Discrete Applied Mathematics , 157 : 49 – 67 .
  • Rothaermel , D. 2011 . “ The 2010 annual forging industry sales released by forging industry association ” . available from http://www.forging.org/press/pdf/09stat_release_web.pdf (accessed November 15, 2011).
  • Sahni , S. 2005 . Data Structures, Algorithms, and Applications in C++, second edition , Summit, NJ : Silicon Press .
  • Wy , J. and Kim , B. 2010 . Two-staged guillotine cut, two-dimensional bin packing optimization with flexible bin sizes for steel mother plate design . International Journal of Production Research , 48 ( 22 ) : 6799 – 6820 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.