IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v293y2026ics0925527325003810.html

A modeling and optimization approach to a tactical sugarcane harvest planning problem

Author

Listed:
  • Oliveira Soler, Willy A.
  • Santos, Maristela Oliveira
  • Junqueira, Rogério de Ávila Ribeiro
  • Morabito, Reinaldo

Abstract

In this paper, we address a tactical sugarcane harvest planning problem commonly faced by industries that cultivate, harvest, and process sugarcane in Brazil and some other countries. The problem involves a single mill that must harvest sugarcane from several geographically dispersed areas (harvest blocks) using capacitated mechanized harvest fronts. The objective is to minimize the total costs of the harvest process while satisfying operational constraints, including capacity limits for transportation and harvesting. We propose a new mixed-integer programming (MIP) model and develop MIP-based constructive and improvement heuristic procedures. In the constructive phase, the method generates a strong dual bound and an initial feasible solution, while the improvement phase refines this solution to achieve higher quality. The efficiency of the proposed methods is evaluated through computational experiments using a dataset based on real-world scenarios. Additionally, a sensitivity analysis provides managerial insights by examining different harvest front configurations.

Suggested Citation

  • Oliveira Soler, Willy A. & Santos, Maristela Oliveira & Junqueira, Rogério de Ávila Ribeiro & Morabito, Reinaldo, 2026. "A modeling and optimization approach to a tactical sugarcane harvest planning problem," International Journal of Production Economics, Elsevier, vol. 293(C).
    • Handle: RePEc:eee:proeco:v:293:y:2026:i:c:s0925527325003810
    DOI: 10.1016/j.ijpe.2025.109896
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527325003810
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2025.109896?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Helenice de Oliveira Florentino & Chandra Irawan & Angelo Filho Aliano & Dylan F. Jones & Daniela Renata Cantane & Jonis Jecks Nervis, 2018. "A multiple objective methodology for sugarcane harvest management with varying maturation periods," Annals of Operations Research, Springer, vol. 267(1), pages 153-177, August.
    2. Guimarães, Luis & Klabjan, Diego & Almada-Lobo, Bernardo, 2014. "Modeling lotsizing and scheduling problems with sequence dependent setups," European Journal of Operational Research, Elsevier, vol. 239(3), pages 644-662.
    3. Willy A. O. Soler & Maristela O. Santos & Kerem Akartunalı, 2021. "MIP approaches for a lot sizing and scheduling problem on multiple production lines with scarce resources, temporary workstations, and perishable products," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(8), pages 1691-1706, August.
    4. Ferreira, Deisemara & Morabito, Reinaldo & Rangel, Socorro, 2009. "Solution approaches for the soft drink integrated production lot sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 196(2), pages 697-706, July.
    5. Fleischmann, B. & Meyr, H., 1997. "The General Lotsizing and Scheduling Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 36068, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    6. Meyr, Herbert, 2002. "Simultaneous lotsizing and scheduling on parallel machines," European Journal of Operational Research, Elsevier, vol. 139(2), pages 277-292, June.
    7. K. A. G. Araujo & E. G. Birgin & M. S. Kawamura & D. P. Ronconi, 2023. "Relax-and-Fix Heuristics Applied to a Real-World Lot Sizing and Scheduling Problem in the Personal Care Consumer Goods Industry," SN Operations Research Forum, Springer, vol. 4(2), pages 1-30, June.
    8. Junqueira, Rogerio de Ávila Ribeiro & Morabito, Reinaldo, 2019. "Modeling and solving a sugarcane harvest front scheduling problem," International Journal of Production Economics, Elsevier, vol. 213(C), pages 150-160.
    9. Lang, Jan Christian & Shen, Zuo-Jun Max, 2011. "Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions," European Journal of Operational Research, Elsevier, vol. 214(3), pages 595-605, November.
    10. Grunow, M. & Gunther, H.-O. & Westinner, R., 2007. "Supply optimization for the production of raw sugar," International Journal of Production Economics, Elsevier, vol. 110(1-2), pages 224-239, October.
    11. Dillenberger, Christof & Escudero, Laureano F. & Wollensak, Artur & Zhang, Wu, 1994. "On practical resource allocation for production planning and scheduling with period overlapping setups," European Journal of Operational Research, Elsevier, vol. 75(2), pages 275-286, June.
    12. Meyr, H., 2002. "Simultaneous Lotsizing and Scheduling on Parallel Machines," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 36065, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    13. AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.
    14. Jena, Sanjay Dominik & Poggi, Marcus, 2013. "Harvest planning in the Brazilian sugar cane industry via mixed integer programming," European Journal of Operational Research, Elsevier, vol. 230(2), pages 374-384.
    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. Junqueira, Rogerio de Ávila Ribeiro & Morabito, Reinaldo, 2019. "Modeling and solving a sugarcane harvest front scheduling problem," International Journal of Production Economics, Elsevier, vol. 213(C), pages 150-160.
    2. Karina Copil & Martin Wörbelauer & Herbert Meyr & Horst Tempelmeier, 2017. "Simultaneous lotsizing and scheduling problems: a classification and review of models," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 1-64, January.
    3. Mac Cawley, Alejandro & Maturana, Sergio & Pascual, Rodrigo & Tortorella, Guilherme Luz, 2022. "Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: Robust formulation and a decomposition solution approach," European Journal of Operational Research, Elsevier, vol. 303(2), pages 819-839.
    4. Ferreira, Deisemara & Clark, Alistair R. & Almada-Lobo, Bernardo & Morabito, Reinaldo, 2012. "Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production," International Journal of Production Economics, Elsevier, vol. 136(2), pages 255-265.
    5. Carvalho, Desiree M. & Nascimento, Mariá C.V., 2022. "Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup," European Journal of Operational Research, Elsevier, vol. 296(1), pages 158-173.
    6. Guimarães, Luis & Klabjan, Diego & Almada-Lobo, Bernardo, 2013. "Pricing, relaxing and fixing under lot sizing and scheduling," European Journal of Operational Research, Elsevier, vol. 230(2), pages 399-411.
    7. Curcio, Eduardo & Amorim, Pedro & Zhang, Qi & Almada-Lobo, Bernardo, 2018. "Adaptation and approximate strategies for solving the lot-sizing and scheduling problem under multistage demand uncertainty," International Journal of Production Economics, Elsevier, vol. 202(C), pages 81-96.
    8. Lee, Younsoo & Lee, Kyungsik, 2022. "New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 302(1), pages 230-243.
    9. Martin Wörbelauer & Herbert Meyr & Bernardo Almada-Lobo, 2019. "Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 1-43, March.
    10. Camargo, Victor C.B. & Toledo, Franklina M.B. & Almada-Lobo, Bernardo, 2014. "HOPS – Hamming-Oriented Partition Search for production planning in the spinning industry," European Journal of Operational Research, Elsevier, vol. 234(1), pages 266-277.
    11. Alyne Toscano & Deisemara Ferreira & Reinaldo Morabito, 2019. "A decomposition heuristic to solve the two-stage lot sizing and scheduling problem with temporal cleaning," Flexible Services and Manufacturing Journal, Springer, vol. 31(1), pages 142-173, March.
    12. Meyr, Herbert & Mann, Matthias, 2013. "A decomposition approach for the General Lotsizing and Scheduling Problem for Parallel production Lines," European Journal of Operational Research, Elsevier, vol. 229(3), pages 718-731.
    13. Masoumeh Mahdieh & Alistair Clark & Mehdi Bijari, 2018. "A novel flexible model for lot sizing and scheduling with non-triangular, period overlapping and carryover setups in different machine configurations," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 884-923, December.
    14. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    15. Aliano Filho, Angelo & A． Oliveira, Washington & Melo, Teresa, 2023. "Multi-objective optimization for integrated sugarcane cultivation and harvesting planning," European Journal of Operational Research, Elsevier, vol. 309(1), pages 330-344.
    16. Willy A. Oliveira Soler & Maristela O. Santos & Kerem Akartunalı, 2025. "Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times," Journal of Heuristics, Springer, vol. 31(1), pages 1-35, March.
    17. K. A. G. Araujo & E. G. Birgin & M. S. Kawamura & D. P. Ronconi, 2023. "Relax-and-Fix Heuristics Applied to a Real-World Lot Sizing and Scheduling Problem in the Personal Care Consumer Goods Industry," SN Operations Research Forum, Springer, vol. 4(2), pages 1-30, June.
    18. Fabrizio Marinelli & Maria Nenni & Antonio Sforza, 2007. "Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company," Annals of Operations Research, Springer, vol. 150(1), pages 177-192, March.
    19. Józefowska, J. & Zimniak, A., 2008. "Optimization tool for short-term production planning and scheduling," International Journal of Production Economics, Elsevier, vol. 112(1), pages 109-120, March.
    20. Ríos-Solís, Yasmín Á & Ibarra-Rojas, Omar J. & Cabo, Marta & Possani, Edgar, 2020. "A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production," European Journal of Operational Research, Elsevier, vol. 284(3), pages 861-873.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:293:y:2026:i:c:s0925527325003810. 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.