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

Heuristic and exact methods for the cutting sequencing problem

Author

Listed:
  • Faggioli, Enrico
  • Bentivoglio, Carlo Alberto

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:110:y:1998:i:3:p:564-575
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00268-3
    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. Cheng, C. H. & Feiring, B. R. & Cheng, T. C. E., 1994. "The cutting stock problem -- a survey," International Journal of Production Economics, Elsevier, vol. 36(3), pages 291-305, October.
    2. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    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. Yuen, Boon J., 1995. "Improved heuristics for sequencing cutting patterns," European Journal of Operational Research, Elsevier, vol. 87(1), pages 57-64, November.
    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. 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. 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.
    3. 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.
    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. de Gelder, E.R. & Wagelmans, A.P.M., 2007. "The two-dimensional cutting stock problem within the roller blind production process," Econometric Institute Research Papers EI 2007-47, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. 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.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Marianov, Vladimir & Serra, Daniel & ReVelle, Charles, 1999. "Location of hubs in a competitive environment," European Journal of Operational Research, Elsevier, vol. 114(2), pages 363-371, April.
    11. Chiara Gruden & Irena Ištoka Otković & Matjaž Šraml, 2020. "Neural Networks Applied to Microsimulation: A Prediction Model for Pedestrian Crossing Time," Sustainability, MDPI, vol. 12(13), pages 1-22, July.
    12. Thibaud Deguilhem & Juliette Schlegel & Jean-Philippe Berrou & Ousmane Djibo & Alain Piveteau, 2024. "Too many options: How to identify coalitions in a policy network?," Post-Print hal-04689665, HAL.
    13. Helena Ramalhinho-Lourenço & Olivier C. Martin & Thomas Stützle, 2000. "Iterated local search," Economics Working Papers 513, Department of Economics and Business, Universitat Pompeu Fabra.
    14. 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.
    15. Сластников С.А., 2014. "Применение Метаэвристических Алгоритмов Для Задачи Маршрутизации Транспорта," Журнал Экономика и математические методы (ЭММ), Центральный Экономико-Математический Институт (ЦЭМИ), vol. 50(1), pages 117-126, январь.
    16. Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
    17. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    18. Rego, Cesar & Roucairol, Catherine, 1995. "Using Tabu search for solving a dynamic multi-terminal truck dispatching problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 411-429, June.
    19. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    20. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.

    More about this item

    Statistics

    Access and download statistics

    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:110:y:1998:i:3:p:564-575. 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.