IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v203y2010i3p559-567.html
   My bibliography  Save this article

The minimization of open stacks problem: A review of some properties and their use in pre-processing operations

Author

Listed:
  • Yanasse, Horacio Hideki
  • Senne, Edson Luiz França

Abstract

Pre-processing operations that reduce the size of a problem may be decisive for solving or not solving practical instances of a NP-hard problem. In this article we review some properties suggested in the literature for the minimization of open stacks problem that can be used in pre-processing operations to reduce the instances sizes. We also present a new pre-processing technique that may be very effective in reducing the size of an instance. We present computational tests with the suggested pre-processing operations applied on sets of MOSP instances of the literature and we show that the reductions obtained can be significant.

Suggested Citation

  • Yanasse, Horacio Hideki & Senne, Edson Luiz França, 2010. "The minimization of open stacks problem: A review of some properties and their use in pre-processing operations," European Journal of Operational Research, Elsevier, vol. 203(3), pages 559-567, June.
    • Handle: RePEc:eee:ejores:v:203:y:2010:i:3:p:559-567
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00632-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Foerster, Hildegard & Wascher, Gerhard, 1998. "Simulated annealing for order spread minimization in sequencing cutting patterns," European Journal of Operational Research, Elsevier, vol. 110(2), pages 272-281, October.
    2. Faggioli, Enrico & Bentivoglio, Carlo Alberto, 1998. "Heuristic and exact methods for the cutting sequencing problem," European Journal of Operational Research, Elsevier, vol. 110(3), pages 564-575, November.
    3. Yuen, Boon J. & Richardson, Ken V., 1995. "Establishing the optimality of sequencing heuristics for cutting stock problems," European Journal of Operational Research, Elsevier, vol. 84(3), pages 590-598, August.
    4. Yuen, Boon J., 1991. "Heuristics for sequencing cutting patterns," European Journal of Operational Research, Elsevier, vol. 55(2), pages 183-190, November.
    5. Maria Garcia de la Banda & Peter J. Stuckey, 2007. "Dynamic Programming to Minimize the Maximum Number of Open Stacks," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 607-617, November.
    6. Christopher S. Tang & Eric V. Denardo, 1988. "Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches," Operations Research, INFORMS, vol. 36(5), pages 767-777, October.
    7. Lim, Andrew & Rodrigues, Brian & Xiao, Fei, 2006. "Heuristics for matrix bandwidth reduction," European Journal of Operational Research, Elsevier, vol. 174(1), pages 69-91, October.
    8. Yuen, Boon J., 1995. "Improved heuristics for sequencing cutting patterns," European Journal of Operational Research, Elsevier, vol. 87(1), pages 57-64, November.
    9. Yanasse, Horacio Hideki, 1997. "On a pattern sequencing problem to minimize the maximum number of open stacks," European Journal of Operational Research, Elsevier, vol. 100(3), pages 454-463, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cui, Yaodong & Huang, Baixiong, 2012. "Reducing the number of cuts in generating three-staged cutting patterns," European Journal of Operational Research, Elsevier, vol. 218(2), pages 358-365.
    2. Matthias Kaltenbrunner & Maria Anna Huka & Manfred Gronalt, 2022. "Heuristic based approach for short term production planning in highly automated customer oriented pallet production," Journal of Intelligent Manufacturing, Springer, vol. 33(4), pages 1087-1098, April.

    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. Yanasse, Horacio Hideki & Pinto Lamosa, Maria Jose, 2007. "An integrated cutting stock and sequencing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1353-1370, December.
    2. Armbruster, Michael, 2002. "A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry," European Journal of Operational Research, Elsevier, vol. 141(2), pages 328-340, September.
    3. 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.
    4. Maria Garcia de la Banda & Peter J. Stuckey, 2007. "Dynamic Programming to Minimize the Maximum Number of Open Stacks," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 607-617, November.
    5. Maria Garcia de la Banda & Peter J. Stuckey & Geoffrey Chu, 2011. "Solving Talent Scheduling with Dynamic Programming," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 120-137, February.
    6. Rafael de Magalhães Dias Frinhani & Marco Antonio Moreira de Carvalho & Nei Yoshihiro Soma, 2018. "A PageRank-based heuristic for the minimization of open stacks problem," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-24, August.
    7. Foerster, Hildegard & Wascher, Gerhard, 1998. "Simulated annealing for order spread minimization in sequencing cutting patterns," European Journal of Operational Research, Elsevier, vol. 110(2), pages 272-281, October.
    8. Faggioli, Enrico & Bentivoglio, Carlo Alberto, 1998. "Heuristic and exact methods for the cutting sequencing problem," European Journal of Operational Research, Elsevier, vol. 110(3), pages 564-575, November.
    9. Morabito, Reinaldo & Belluzzo, Luciano, 2007. "Optimising the cutting of wood fibre plates in the hardboard industry," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1405-1420, December.
    10. Wuttke, David A. & Heese, H. Sebastian, 2018. "Two-dimensional cutting stock problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 265(1), pages 303-315.
    11. Arbib, Claudio & Marinelli, Fabrizio & Pezzella, Ferdinando, 2012. "An LP-based tabu search for batch scheduling in a cutting process with finite buffers," International Journal of Production Economics, Elsevier, vol. 136(2), pages 287-296.
    12. Yuen, Boon J. & Richardson, Ken V., 1995. "Establishing the optimality of sequencing heuristics for cutting stock problems," European Journal of Operational Research, Elsevier, vol. 84(3), pages 590-598, August.
    13. Arbib, Claudio & Felici, Giovanni & Servilio, Mara, 2019. "Common operation scheduling with general processing times: A branch-and-cut algorithm to minimize the weighted number of tardy jobs," Omega, Elsevier, vol. 84(C), pages 18-30.
    14. Yanasse, Horacio Hideki, 1997. "On a pattern sequencing problem to minimize the maximum number of open stacks," European Journal of Operational Research, Elsevier, vol. 100(3), pages 454-463, August.
    15. 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.
    16. Yves Crama & Joris van de Klundert, 1999. "Worst‐case performance of approximation algorithms for tool management problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 445-462, August.
    17. Yazdani Sabouni, M.T. & Logendran, Rasaratnam, 2013. "Carryover sequence-dependent group scheduling with the integration of internal and external setup times," European Journal of Operational Research, Elsevier, vol. 224(1), pages 8-22.
    18. Anselmo Ramalho Pitombeira-Neto & Bruno de Athayde Prata, 2020. "A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(1), pages 178-192, April.
    19. Calmels, Dorothea, 2022. "An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines," European Journal of Operational Research, Elsevier, vol. 297(1), pages 66-85.
    20. Daniels, Richard L. & Rummel, Jeffrey L. & Schantz, Robert, 1998. "A model for warehouse order picking," European Journal of Operational Research, Elsevier, vol. 105(1), pages 1-17, February.

    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:eee:ejores:v:203:y:2010:i:3:p:559-567. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.