IDEAS home Printed from https://ideas.repec.org/p/ibm/ibmecp/wpe_178.html
   My bibliography  Save this paper

An Exact Approach to the Relaxed Combined Production Planning Model

Author

Listed:
  • Gramani, Maria Cristina N.
  • França, Paulo M.
  • Arenales, Marcos N.

Abstract

No abstract is available for this item.

Suggested Citation

  • Gramani, Maria Cristina N. & França, Paulo M. & Arenales, Marcos N., 2011. "An Exact Approach to the Relaxed Combined Production Planning Model," Insper Working Papers wpe_178, Insper Working Paper, Insper Instituto de Ensino e Pesquisa.
    • Handle: RePEc:ibm:ibmecp:wpe_178
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0016003210001560
    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. William W. Trigeiro & L. Joseph Thomas & John O. McClain, 1989. "Capacitated Lot Sizing with Setup Times," Management Science, INFORMS, vol. 35(3), pages 353-366, March.
    3. 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.
    4. Nonas, Sigrid Lise & Thorstenson, Anders, 2000. "A combined cutting-stock and lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 120(2), pages 327-342, January.
    5. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    6. Armentano, Vinícius A. & França, Paulo M. & de Toledo, Franklina M. B., 1999. "A network flow model for the capacitated lot-sizing problem," Omega, Elsevier, vol. 27(2), pages 275-284, April.
    7. 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.
    8. Unknown, 1986. "Letters," Choices: The Magazine of Food, Farm, and Resource Issues, Agricultural and Applied Economics Association, vol. 1(4), pages 1-9.
    9. Gramani, Maria Cristina N. & Franca, Paulo M., 2006. "The combined cutting stock and lot-sizing problem in industrial processes," European Journal of Operational Research, Elsevier, vol. 174(1), pages 509-521, October.
    10. Robert W. Haessler, 1971. "A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem," Management Science, INFORMS, vol. 17(12), pages 793-802, August.
    11. 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. 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.
    2. Oliveira, Washington A. & Fiorotto, Diego J. & Song, Xiang & Jones, Dylan F., 2021. "An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 996-1007.
    3. 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.
    4. Amanda O. C. Ayres & Betania S. C. Campello & Washington A. Oliveira & Carla T. L. S. Ghidini, 2021. "A Bi-Integrated Model for coupling lot-sizing and cutting-stock problems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(4), pages 1047-1076, December.
    5. Kelly Cristina Poldi & Silvio Alexandre Araujo, 2016. "Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem," Annals of Operations Research, Springer, vol. 238(1), pages 497-520, March.
    6. 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.
    7. 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.
    8. Tao Wu & Kerem Akartunal? & Raf Jans & Zhe Liang, 2017. "Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 523-543, August.
    9. Kelly Poldi & Silvio Araujo, 2016. "Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem," Annals of Operations Research, Springer, vol. 238(1), pages 497-520, March.
    10. Song, X. & Chu, C.B. & Nie, Y.Y. & Bennell, J.A., 2006. "An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1870-1889, December.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. Bhadury, J. & Chandrasekaran, R., 1996. "Stock cutting to minimize cutting length," European Journal of Operational Research, Elsevier, vol. 88(1), pages 69-87, January.
    16. Toledo, Franklina Maria Bragion & Armentano, Vinicius Amaral, 2006. "A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1070-1083, December.
    17. Gramani, Maria Cristina N. & Franca, Paulo M., 2006. "The combined cutting stock and lot-sizing problem in industrial processes," European Journal of Operational Research, Elsevier, vol. 174(1), pages 509-521, October.
    18. Hadjiconstantinou, Eleni & Christofides, Nicos, 1995. "An exact algorithm for general, orthogonal, two-dimensional knapsack problems," European Journal of Operational Research, Elsevier, vol. 83(1), pages 39-56, May.
    19. 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.
    20. Christofides, Nicos & Hadjiconstantinou, Eleni, 1995. "An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts," European Journal of Operational Research, Elsevier, vol. 83(1), pages 21-38, May.

    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:ibm:ibmecp:wpe_178. 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: Naercio Menezes (email available below). General contact details of provider: https://edirc.repec.org/data/ibmecbr.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.