IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v83y2003i3p233-246.html
   My bibliography  Save this article

On the best number of different standard lengths to stock for one-dimensional assortment problems

Author

Listed:
  • Holthaus, Oliver

Abstract

No abstract is available for this item.

Suggested Citation

  • Holthaus, Oliver, 2003. "On the best number of different standard lengths to stock for one-dimensional assortment problems," International Journal of Production Economics, Elsevier, vol. 83(3), pages 233-246, March.
    • Handle: RePEc:eee:proeco:v:83:y:2003:i:3:p:233-246
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(02)00375-4
    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. Hinxman, A. I., 1980. "The trim-loss and assortment problems: A survey," European Journal of Operational Research, Elsevier, vol. 5(1), pages 8-18, July.
    2. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    3. Wieslaw Sadowski, 1959. "A Few Remarks on the Assortment Problem," Cowles Foundation Discussion Papers 67, Cowles Foundation for Research in Economics, Yale University.
    4. David W. Pentico, 1976. "The Assortment Problem with Nonlinear Cost Functions," Operations Research, INFORMS, vol. 24(6), pages 1129-1142, December.
    5. Holthaus, Oliver, 2002. "Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths," European Journal of Operational Research, Elsevier, vol. 141(2), pages 295-312, September.
    6. Beasley, J. E., 1985. "An algorithm for the two-dimensional assortment problem," European Journal of Operational Research, Elsevier, vol. 19(2), pages 253-261, February.
    7. Wieslaw Sadowski, 1959. "A Few Remarks on the Assortment Problem," Management Science, INFORMS, vol. 6(1), pages 13-24, October.
    8. P. C. Gilmore & R. E. Gomory, 1963. "A Linear Programming Approach to the Cutting Stock Problem---Part II," Operations Research, INFORMS, vol. 11(6), pages 863-888, December.
    9. M. L. Wolfson, 1965. "Selecting the Best Lengths to Stock," Operations Research, INFORMS, vol. 13(4), pages 570-585, August.
    10. Dyckhoff, H & Kruse, H-J & Abel, D & Gal, T, 1985. "Trim loss and related problems," Omega, Elsevier, vol. 13(1), pages 59-72.
    11. Baker, Barrie M., 1999. "A spreadsheet modelling approach to the assortment problem," European Journal of Operational Research, Elsevier, vol. 114(1), pages 83-92, April.
    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. C. Arbib & F. Marinelli, 2009. "Exact and Asymptotically Exact Solutions for a Class of Assortment Problems," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 13-25, February.
    2. 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.
    3. 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.
    4. Trkman, Peter & Gradisar, Miro, 2007. "One-dimensional cutting stock optimization in consecutive time periods," European Journal of Operational Research, Elsevier, vol. 179(2), pages 291-301, June.
    5. Arbib, Claudio & Marinelli, Fabrizio, 2007. "An optimization model for trim loss minimization in an automotive glass plant," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1421-1432, December.
    6. Gasimov, Rafail N. & Sipahioglu, Aydin & Sarac, Tugba, 2007. "A multi-objective programming approach to 1.5-dimensional assortment problem," European Journal of Operational Research, Elsevier, vol. 179(1), pages 64-79, May.

    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. Pentico, David W., 2008. "The assortment problem: A survey," European Journal of Operational Research, Elsevier, vol. 190(2), pages 295-309, October.
    2. Baloch, Gohram & Gzara, Fatma, 2020. "Capacity and assortment planning under one-way supplier-driven substitution for pharmacy kiosks with low drug demand," European Journal of Operational Research, Elsevier, vol. 282(1), pages 108-128.
    3. 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.
    4. Sierra-Paradinas, María & Soto-Sánchez, Óscar & Alonso-Ayuso, Antonio & Martín-Campo, F. Javier & Gallego, Micael, 2021. "An exact model for a slitting problem in the steel industry," European Journal of Operational Research, Elsevier, vol. 295(1), pages 336-347.
    5. Cherri, Adriana Cristina & Arenales, Marcos Nereu & Yanasse, Horacio Hideki & Poldi, Kelly Cristina & Gonçalves Vianna, Andréa Carla, 2014. "The one-dimensional cutting stock problem with usable leftovers – A survey," European Journal of Operational Research, Elsevier, vol. 236(2), pages 395-402.
    6. Sônia Poltroniere & Kelly Poldi & Franklina Toledo & Marcos Arenales, 2008. "A coupling cutting stock-lot sizing problem in the paper industry," Annals of Operations Research, Springer, vol. 157(1), pages 91-104, January.
    7. Na, Byungsoo & Ahmed, Shabbir & Nemhauser, George & Sokol, Joel, 2013. "Optimization of automated float glass lines," International Journal of Production Economics, Elsevier, vol. 145(2), pages 561-572.
    8. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
    9. Krzysztof C. Kiwiel, 2010. "An Inexact Bundle Approach to Cutting-Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 131-143, February.
    10. 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.
    11. Aktin, Tülin & Özdemir, RIfat Gürcan, 2009. "An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing," European Journal of Operational Research, Elsevier, vol. 196(2), pages 737-743, July.
    12. Pedro Rochavetz Lara Andrade & Silvio Alexandre Araujo & Adriana Cristina Cherri & Felipe Kesrouani Lemos, 2023. "The cutting stock problem applied to the hardening process in an automotive spring factory," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(2), pages 637-664, June.
    13. 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.
    14. Gonçalo R. L. Cerqueira & Sérgio S. Aguiar & Marlos Marques, 2021. "Modified Greedy Heuristic for the one-dimensional cutting stock problem," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 657-674, October.
    15. C. Arbib & F. Marinelli, 2009. "Exact and Asymptotically Exact Solutions for a Class of Assortment Problems," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 13-25, February.
    16. Hoto, Robinson & Arenales, Marcos & Maculan, Nelson, 2007. "The one dimensional Compartmentalised Knapsack Problem: A case study," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1183-1195, December.
    17. Trkman, Peter & Gradisar, Miro, 2007. "One-dimensional cutting stock optimization in consecutive time periods," European Journal of Operational Research, Elsevier, vol. 179(2), pages 291-301, June.
    18. Malaguti, Enrico & Medina Durán, Rosa & Toth, Paolo, 2014. "Approaches to real world two-dimensional cutting problems," Omega, Elsevier, vol. 47(C), pages 99-115.
    19. Cherri, Adriana Cristina & Arenales, Marcos Nereu & Yanasse, Horacio Hideki, 2009. "The one-dimensional cutting stock problem with usable leftover - A heuristic approach," European Journal of Operational Research, Elsevier, vol. 196(3), pages 897-908, August.
    20. Alves, Claudio & Valerio de Carvalho, J.M., 2007. "Accelerating column generation for variable sized bin-packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1333-1352, December.

    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:proeco:v:83:y:2003:i:3:p:233-246. 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/ijpe .

    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.