IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v205y2026ics1366554525005411.html

Grain drying capacity planning and scheduling under yield uncertainty: Minimizing post-harvest losses and operational costs

Author

Listed:
  • Wang, Lin
  • Zhang, Ziqing
  • Wang, Sirui

Abstract

This paper investigates the joint optimization of grain drying capacity planning and scheduling under yield uncertainty, to minimize operational costs and reduce post-harvest losses. We propose a two-stage stochastic optimization model that integrates decisions on post-harvest service center (PHSC) selection, initial drying machine deployment, and grain origin allocation in the first stage. In the second stage, after yield realization, the model addresses machine supplementation and detailed drying task scheduling. To handle the complexity arising from scheduling feasibility constraints, we propose an exact solution approach based on logic-based Benders decomposition (LBBD). In this approach, scheduling feasibility is efficiently determined using the preemptive earliest due date (PEDD) rule, and customized Benders cuts are developed. Additionally, acceleration techniques, including multi-cut strategies, valid inequalities, and the minimal infeasible subset (MIS) method, are employed to enhance computational efficiency. We validate the effectiveness and scalability of the proposed solution approach through extensive computational experiments, which solve instances with up to 120 origins and 200 yield scenarios within one hour. Two sensitivity analyses are conducted to assess the impact of second-stage machine costs and different scheduling rules on resource utilization and total cost performance. A real-world case study based on data from Hubei Province in China further demonstrates the practical applicability of our model and method. In this case study, a data-driven approach is used to characterize yield uncertainty by fitting historical yield data to probability distributions to ensure realistic scenario generation.

Suggested Citation

  • Wang, Lin & Zhang, Ziqing & Wang, Sirui, 2026. "Grain drying capacity planning and scheduling under yield uncertainty: Minimizing post-harvest losses and operational costs," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 205(C).
  • Handle: RePEc:eee:transe:v:205:y:2026:i:c:s1366554525005411
    DOI: 10.1016/j.tre.2025.104513
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554525005411
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2025.104513?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. Bahman Naderi & Kannan Govindan & Hamed Soleimani, 2020. "A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network," Annals of Operations Research, Springer, vol. 291(1), pages 685-705, August.
    2. Roshanaei, Vahid & Luong, Curtiss & Aleman, Dionne M. & Urbach, David, 2017. "Propagating logic-based Benders’ decomposition approaches for distributed operating room scheduling," European Journal of Operational Research, Elsevier, vol. 257(2), pages 439-455.
    3. An, Kun & Ouyang, Yanfeng, 2016. "Robust grain supply chain design considering post-harvest loss and harvest timing equilibrium," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 110-128.
    4. Wheatley, David & Gzara, Fatma & Jewkes, Elizabeth, 2015. "Logic-based Benders decomposition for an inventory-location problem with service constraints," Omega, Elsevier, vol. 55(C), pages 10-23.
    5. Zhang, Zhe & Song, Xiaoling & Huang, Huijung & Zhou, Xiaoyang & Yin, Yong, 2022. "Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong’s learning effect," European Journal of Operational Research, Elsevier, vol. 297(3), pages 866-877.
    6. Naderi, Bahman & Roshanaei, Vahid, 2020. "Branch-Relax-and-Check: A tractable decomposition method for order acceptance and identical parallel machine scheduling," European Journal of Operational Research, Elsevier, vol. 286(3), pages 811-827.
    7. Han, Jialin & Zhang, Jiaxiang & Zeng, Bing & Mao, Mingsong, 2021. "Optimizing dynamic facility location-allocation for agricultural machinery maintenance using Benders decomposition," Omega, Elsevier, vol. 105(C).
    8. Fatemeh Keshavarz-Ghorbani & Seyed Hamid Reza Pasandideh, 2022. "A Lagrangian relaxation algorithm for optimizing a bi-objective agro-supply chain model considering CO2 emissions," Annals of Operations Research, Springer, vol. 314(2), pages 497-527, July.
    9. Ashok Gulati & Raya Das & Alex Winter-Nelson, 2024. "Reducing Post-Harvest Losses in India: Farmer-Level Interventions and Grain Management Strategies," Indian Council for Research on International Economic Relations (ICRIER) Report 24-r-03, Indian Council for Research on International Economic Relations (ICRIER), New Delhi, India.
    10. Kusumastuti, Ratih Dyah & Donk, Dirk Pieter van & Teunter, Ruud, 2016. "Crop-related harvesting and processing planning: a review," International Journal of Production Economics, Elsevier, vol. 174(C), pages 76-92.
    11. Sadykov, Ruslan, 2008. "A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1284-1304, September.
    12. Yang, Zhen & Chen, Haoxun & Chu, Feng & Wang, Nengmin, 2019. "An effective hybrid approach to the two-stage capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 275(2), pages 467-480.
    13. Luo, Na & Olsen, Tava & Liu, Yanping & Zhang, Abraham, 2022. "Reducing food loss and waste in supply chain operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 162(C).
    14. Maiyar, Lohithaksha M & Thakkar, Jitesh J, 2019. "Environmentally conscious logistics planning for food grain industry considering wastages employing multi objective hybrid particle swarm optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 220-248.
    15. J. N. Hooker, 2007. "Planning and Scheduling by Logic-Based Benders Decomposition," Operations Research, INFORMS, vol. 55(3), pages 588-602, June.
    16. Sun, Defeng & Tang, Lixin & Baldacci, Roberto, 2019. "A Benders decomposition-based framework for solving quay crane scheduling problems," European Journal of Operational Research, Elsevier, vol. 273(2), pages 504-515.
    17. Chen, Sumin & Zeng, Qingcheng & Li, Yantong, 2023. "Integrated operations planning in highly electrified container terminals considering time-of-use tariffs," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    18. Jean-François Côté & Mohamed Haouari & Manuel Iori, 2021. "Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 963-978, July.
    19. Kong, Lingrui & Ji, Mingjun & Gao, Zhendi, 2022. "An exact algorithm for scheduling tandem quay crane operations in container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    20. Mogale, D.G. & Kumar, Mukesh & Kumar, Sri Krishna & Tiwari, Manoj Kumar, 2018. "Grain silo location-allocation problem with dwell time for optimization of food grain supply chain network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 40-69.
    21. Yantong Li & Jean-François Côté & Leandro Callegari-Coelho & Peng Wu, 2022. "Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1048-1069, March.
    22. Corinna Heßler & Kaouthar Deghdak, 2017. "Discrete parallel machine makespan ScheLoc problem," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1159-1186, November.
    23. Mohammad M. Fazel-Zarandi & J. Christopher Beck, 2012. "Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 387-398, August.
    24. Gohram Baloch & Fatma Gzara, 2020. "Strategic Network Design for Parcel Delivery with Drones Under Competition," Transportation Science, INFORMS, vol. 54(1), pages 204-228, January.
    25. Lin, Na & Kanellopoulos, Argyris & Akkerman, Renzo & Zhang, Jianghua & Ruan, Junhu, 2025. "Vehicle routing in precooling logistics with dynamic temperature-dependent product quality decay," European Journal of Operational Research, Elsevier, vol. 321(2), pages 407-427.
    26. Lin, Na & Akkerman, Renzo & Kanellopoulos, Argyris & Hu, Xiangpei & Wang, Xuping & Ruan, Junhu, 2023. "Vehicle routing with heterogeneous service types: Optimizing post-harvest preprocessing operations for fruits and vegetables in short food supply chains," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).
    27. D. G. Mogale & Sri Krishna Kumar & Manoj Kumar Tiwari, 2020. "Green food supply chain design considering risk and post-harvest losses: a case study," Annals of Operations Research, Springer, vol. 295(1), pages 257-284, December.
    28. Etemadnia, Hamideh & Goetz, Stephan J. & Canning, Patrick & Tavallali, Mohammad Sadegh, 2015. "Optimal wholesale facilities location within the fruit and vegetables supply chain with bimodal transportation options: An LP-MIP heuristic approach," European Journal of Operational Research, Elsevier, vol. 244(2), pages 648-661.
    29. Vahid Roshanaei & Curtiss Luong & Dionne M. Aleman & David R. Urbach, 2017. "Collaborative Operating Room Planning and Scheduling," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 558-580, August.
    30. Seyyed-Mahdi Hosseini-Motlagh & Mohammad Reza Ghatreh Samani & Firoozeh Abbasi Saadi, 2021. "Strategic optimization of wheat supply chain network under uncertainty: a real case study," Operational Research, Springer, vol. 21(3), pages 1487-1527, September.
    31. Barzanjeh, Shakoor & Ahmadizar, Fardin & Arkat, Jamal, 2025. "Logic-based benders decomposition algorithm for robust parallel drone scheduling problem considering uncertain travel times for drones," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 193(C).
    32. Gianni Codato & Matteo Fischetti, 2006. "Combinatorial Benders' Cuts for Mixed-Integer Linear Programming," Operations Research, INFORMS, vol. 54(4), pages 756-766, August.
    33. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    34. Yousefi-Babadi, Abolghasem & Bozorgi-Amiri, Ali & Tavakkoli-Moghaddam, Reza & Govindan, Kannan, 2023. "Redesign of the sustainable wheat-flour-bread supply chain network under uncertainty: An improved robust optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 176(C).
    35. Unsal, Ozgur & Oguz, Ceyda, 2019. "An exact algorithm for integrated planning of operations in dry bulk terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 103-121.
    36. Forbes, M.A. & Harris, M.G. & Jansen, H.M. & van der Schoot, F.A. & Taimre, T., 2024. "Combining optimisation and simulation using logic-based Benders decomposition," European Journal of Operational Research, Elsevier, vol. 312(3), pages 840-854.
    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. Guo, Penghui & Zhu, Jianjun, 2023. "Capacity reservation for humanitarian relief: A logic-based Benders decomposition method with subgradient cut," European Journal of Operational Research, Elsevier, vol. 311(3), pages 942-970.
    2. Xiong, Fuli & Liu, Hengchong, 2026. "Logic-based benders decomposition methods for the distributed flexible job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 329(3), pages 778-797.
    3. Yantong Li & Jean-François Côté & Leandro Callegari-Coelho & Peng Wu, 2022. "Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1048-1069, March.
    4. Nasirian, Araz & Zhang, Lele & Costa, Alysson M. & Abbasi, Babak, 2025. "Multiskilled workforce staffing and scheduling: A logic-based Benders’ decomposition approach," European Journal of Operational Research, Elsevier, vol. 323(1), pages 20-33.
    5. Roshanaei, Vahid & Naderi, Bahman, 2021. "Solving integrated operating room planning and scheduling: Logic-based Benders decomposition versus Branch-Price-and-Cut," European Journal of Operational Research, Elsevier, vol. 293(1), pages 65-78.
    6. Naderi, Bahman & Roshanaei, Vahid, 2020. "Branch-Relax-and-Check: A tractable decomposition method for order acceptance and identical parallel machine scheduling," European Journal of Operational Research, Elsevier, vol. 286(3), pages 811-827.
    7. Hassan Zohali & Bahman Naderi & Vahid Roshanaei, 2022. "Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 315-332, January.
    8. Hu, Linyuan & Zhang, Yuli & Wen, Muyang & Leus, Roel & Zhang, Ningwei, 2025. "Robust parallel machine selection and scheduling with uncertain release times," European Journal of Operational Research, Elsevier, vol. 327(3), pages 838-856.
    9. Li, Yantong & Côté, Jean-François & Coelho, Leandro C. & Zhang, Chuang & Zhang, Shuai, 2023. "Order assignment and scheduling under processing and distribution time uncertainty," European Journal of Operational Research, Elsevier, vol. 305(1), pages 148-163.
    10. Naderi, Bahman & Begen, Mehmet A. & Zaric, Gregory S. & Roshanaei, Vahid, 2023. "A novel and efficient exact technique for integrated staffing, assignment, routing, and scheduling of home care services under uncertainty," Omega, Elsevier, vol. 116(C).
    11. Mao, Zhaofang & Fu, Enyuan & Huang, Dian & Fang, Kan & Chen, Lin, 2024. "Combinatorial Benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints," European Journal of Operational Research, Elsevier, vol. 317(3), pages 890-905.
    12. Zhu, Xuedong & Son, Junbo & Zhang, Xi & Wu, Jianguo, 2023. "Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem," Omega, Elsevier, vol. 117(C).
    13. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    14. Roshanaei, Vahid & Luong, Curtiss & Aleman, Dionne M. & Urbach, David R., 2020. "Reformulation, linearization, and decomposition techniques for balanced distributed operating room scheduling," Omega, Elsevier, vol. 93(C).
    15. Karim Pérez Martínez & Yossiri Adulyasak & Raf Jans, 2022. "Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2177-2191, July.
    16. Amin Dehghanian & Yujia Xie & Nicoleta Serban, 2024. "Identifying Socially Optimal Equilibria Using Combinatorial Properties of Nash Equilibria in Bimatrix Games," INFORMS Journal on Computing, INFORMS, vol. 36(5), pages 1261-1286, September.
    17. Defeng Sun & Lixin Tang & Roberto Baldacci & Zihan Chen, 2024. "A Decomposition Method for the Group-Based Quay Crane Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 543-570, March.
    18. Han, Peiran & Meng, Lingyun & Luan, Xiaojie & Bešinović, Nikola & Miao, Jianrui & Wang, Yihui & Liao, Zhengwen, 2025. "Integrated optimization of train makeup problem and resource scheduling in railway marshalling yards: A hybrid MILP-CP approach with Logic-based Benders decomposition," Transportation Research Part B: Methodological, Elsevier, vol. 200(C).
    19. Roshanaei, Vahid & Booth, Kyle E.C. & Aleman, Dionne M. & Urbach, David R. & Beck, J. Christopher, 2020. "Branch-and-check methods for multi-level operating room planning and scheduling," International Journal of Production Economics, Elsevier, vol. 220(C).
    20. Liu, Bingqian & Bissuel, Côme & Courtot, François & Gicquel, Céline & Quadri, Dominique, 2024. "A generalized Benders decomposition approach for the optimal design of a local multi-energy system," European Journal of Operational Research, Elsevier, vol. 318(1), pages 43-54.

    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:transe:v:205:y:2026:i:c:s1366554525005411. 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/wps/find/journaldescription.cws_home/600244/description#description .

    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.