IDEAS home Printed from https://ideas.repec.org/p/mag/wpaper/120028.html
   My bibliography  Save this paper

SLOPPGEN: A Problem Generator for the Two-Dimensional Rectangular Single Large Object Placement Problem With Defects

Author

Listed:
  • Vera Neidlein

    (Faculty of Economics and Management, Otto-von-Guericke University Magdeburg)

  • André Scholz

    (Faculty of Economics and Management, Otto-von-Guericke University Magdeburg)

  • Gerhard Wäscher

    (Faculty of Management, Economics and Social Sciences, University of Cologne)

Abstract

In this paper, a problem generator for the Two-Dimensional Rectangular Single Large Object Placement Problem is presented in which the large object includes one or several defective areas. The parameters defining this problem are identified and described. The features of the problem generator are pointed out, and it is shown how the program can be used for the generation of reproducible random problem instances.

Suggested Citation

  • Vera Neidlein & André Scholz & Gerhard Wäscher, 2012. "SLOPPGEN: A Problem Generator for the Two-Dimensional Rectangular Single Large Object Placement Problem With Defects," FEMM Working Papers 120028, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    • Handle: RePEc:mag:wpaper:120028
    as

    Download full text from publisher

    File URL: http://www.fww.ovgu.de/fww_media/femm/femm_2012/2012_28.pdf
    File Function: First version, 2011
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Nicos Christofides & Charles Whitlock, 1977. "An Algorithm for Two-Dimensional Cutting Problems," Operations Research, INFORMS, vol. 25(1), pages 30-44, February.
    2. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    3. Gau, T. & Wascher, G., 1995. "CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 84(3), pages 572-579, August.
    4. P. C. Gilmore & R. E. Gomory, 1965. "Multistage Cutting Stock Problems of Two and More Dimensions," Operations Research, INFORMS, vol. 13(1), pages 94-120, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jean-François Côté & Manuel Iori, 2018. "The Meet-in-the-Middle Principle for Cutting and Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 646-661, November.
    2. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    3. Silva, Elsa & Oliveira, José Fernando & Silveira, Tiago & Mundim, Leandro & Carravilla, Maria Antónia, 2023. "The Floating-Cuts model: a general and flexible mixed-integer programming model for non-guillotine and guillotine rectangular cutting problems," Omega, Elsevier, vol. 114(C).
    4. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    5. Felix Prause & Kai Hoppmann-Baum & Boris Defourny & Thorsten Koch, 2021. "The maximum diversity assortment selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 521-554, June.
    6. Vera Neidlein & Gerhard Wäscher, 2008. "SLOPPGEN: A Problem Generator for the Two-Dimensional Rectangular Single Large Object Placement Problem With a Single Defect," FEMM Working Papers 08015, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    7. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    8. Celia Glass & Jeroen Oostrum, 2010. "Bun splitting: a practical cutting stock problem," Annals of Operations Research, Springer, vol. 179(1), pages 15-33, September.
    9. Martinovic, J. & Scheithauer, G. & Valério de Carvalho, J.M., 2018. "A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 458-471.
    10. Ortmann, Frank G. & Ntene, Nthabiseng & van Vuuren, Jan H., 2010. "New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems," European Journal of Operational Research, Elsevier, vol. 203(2), pages 306-315, June.
    11. Marco A. Boschetti & Vittorio Maniezzo & Francesco Strappaveccia, 2016. "Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 540-552, August.
    12. Cintra, G.F. & Miyazawa, F.K. & Wakabayashi, Y. & Xavier, E.C., 2008. "Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation," European Journal of Operational Research, Elsevier, vol. 191(1), pages 61-85, November.
    13. Fabio Furini & Enrico Malaguti & Dimitri Thomopulos, 2016. "Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 736-751, November.
    14. Erjavec, J. & Gradisar, M. & Trkman, P., 2012. "Assessment of stock size to minimize cutting stock production costs," International Journal of Production Economics, Elsevier, vol. 135(1), pages 170-176.
    15. Parreño, F. & Alvarez-Valdes, R., 2021. "Mathematical models for a cutting problem in the glass manufacturing industry," Omega, Elsevier, vol. 103(C).
    16. Russo, Mauro & Sforza, Antonio & Sterle, Claudio, 2013. "An improvement of the knapsack function based algorithm of Gilmore and Gomory for the unconstrained two-dimensional guillotine cutting problem," International Journal of Production Economics, Elsevier, vol. 145(2), pages 451-462.
    17. Gregory S. Taylor & Yupo Chan & Ghulam Rasool, 2017. "A three-dimensional bin-packing model: exact multicriteria solution and computational complexity," Annals of Operations Research, Springer, vol. 251(1), pages 397-427, April.
    18. Marco Antonio Boschetti & Lorenza Montaletti, 2010. "An Exact Algorithm for the Two-Dimensional Strip-Packing Problem," Operations Research, INFORMS, vol. 58(6), pages 1774-1791, December.
    19. Bennell, J.A. & Cabo, M. & Martínez-Sykora, A., 2018. "A beam search approach to solve the convex irregular bin packing problem with guillotine guts," European Journal of Operational Research, Elsevier, vol. 270(1), pages 89-102.
    20. Hifi, Mhand & M'Hallah, Rym, 2006. "Strip generation algorithms for constrained two-dimensional two-staged cutting problems," European Journal of Operational Research, Elsevier, vol. 172(2), pages 515-527, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mag:wpaper:120028. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Guido Henkel (email available below). General contact details of provider: https://edirc.repec.org/data/fwmagde.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.