IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v33y2021i2d10.1007_s10696-020-09386-4.html
   My bibliography  Save this article

Scheduling and loading problem for multiple, identical dry kilns

Author

Listed:
  • Maria Anna Huka

    (University of Natural Resources and Life Sciences)

  • Christian Rindler

    (University of Natural Resources and Life Sciences)

  • Manfred Gronalt

    (University of Natural Resources and Life Sciences)

Abstract

The drying of sawn lumber is one of the major processing steps in sawmills with high production volumes. Existing publications on kiln drying analyse and improve technological conditions, while this paper focuses on the scheduling and loading planning with time availability of the individual dried packages. To improve dry kiln scheduling for multiple and identical kilns in large softwood processing sawmills, heuristic approaches are developed that generate kiln allocation plans according to existing production specifications. The aim is to minimise total tardiness for the drying of all sawn lumber packages while considering technological and capacity restrictions. These heuristics calculate the position, time and kiln for each package, thus solving scheduling and loading problems caused by capacity and stacking limitations. Several heuristic approaches are illustrated and tested with actual production data. In addition, the difference between static and dynamic scheduling for group and batch generation is analysed. Further improvements are possible through: drying of different lumber assortments in one batch, outsourcing the drying of special assortments or investing in supplementary kilns for drying smaller volumes within more flexible time slots.

Suggested Citation

  • Maria Anna Huka & Christian Rindler & Manfred Gronalt, 2021. "Scheduling and loading problem for multiple, identical dry kilns," Flexible Services and Manufacturing Journal, Springer, vol. 33(2), pages 312-336, June.
    • Handle: RePEc:spr:flsman:v:33:y:2021:i:2:d:10.1007_s10696-020-09386-4
    DOI: 10.1007/s10696-020-09386-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-020-09386-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10696-020-09386-4?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Ouhimmou, M. & D'Amours, S. & Beauregard, R. & Ait-Kadi, D. & Chauhan, S. Singh, 2008. "Furniture supply chain tactical planning optimization using a time decomposition approach," European Journal of Operational Research, Elsevier, vol. 189(3), pages 952-970, September.
    2. Ari P. J. Vepsalainen & Thomas E. Morton, 1987. "Priority Rules for Job Shops with Weighted Tardiness Costs," Management Science, INFORMS, vol. 33(8), pages 1035-1047, August.
    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. Alidaee, Bahram & Kochenberger, Gary A. & Amini, Mohammad M., 2001. "Greedy solutions of selection and ordering problems," European Journal of Operational Research, Elsevier, vol. 134(1), pages 203-215, October.
    2. 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.
    3. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    4. Mustapha Ouhimmou & Sophie D'Amours & Robert Beauregard & Daoud Ait-Kadi & Satyaveer Singh Chauhan, 2009. "Optimization Helps Shermag Gain Competitive Edge," Interfaces, INFORMS, vol. 39(4), pages 329-345, August.
    5. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    6. Valente, Jorge M.S., 2007. "Improving the performance of the ATC dispatch rule by using workload data to determine the lookahead parameter value," International Journal of Production Economics, Elsevier, vol. 106(2), pages 563-573, April.
    7. Donghun Lee & Hyeongwon Kang & Dongjin Lee & Jeonwoo Lee & Kwanho Kim, 2023. "Deep Reinforcement Learning-Based Scheduler on Parallel Dedicated Machine Scheduling Problem towards Minimizing Total Tardiness," Sustainability, MDPI, vol. 15(4), pages 1-14, February.
    8. Raúl Mencía & Carlos Mencía, 2021. "One-Machine Scheduling with Time-Dependent Capacity via Efficient Memetic Algorithms," Mathematics, MDPI, vol. 9(23), pages 1-24, November.
    9. Zhaohui Li & Haiyue Yu & Zhaowei Zhou, 2024. "Scheduling of elective operations with coordinated utilization of hospital beds and operating rooms," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-29, July.
    10. Alidaee, Bahram & Gopalan, Suresh, 1997. "A note on the equivalence of two heuristics to minimize total tardiness," European Journal of Operational Research, Elsevier, vol. 96(3), pages 514-517, February.
    11. Michael Pinedo & Marcos Singer, 1999. "A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 1-17, February.
    12. Alvarez-Valdes, R. & Fuertes, A. & Tamarit, J. M. & Gimenez, G. & Ramos, R., 2005. "A heuristic to schedule flexible job-shop in a glass factory," European Journal of Operational Research, Elsevier, vol. 165(2), pages 525-534, September.
    13. Black, Gary W. & McKay, Kenneth N. & Morton, Thomas E., 2006. "Aversion scheduling in the presence of risky jobs," European Journal of Operational Research, Elsevier, vol. 175(1), pages 338-361, November.
    14. S H Yoon & I S Lee, 2011. "New constructive heuristics for the total weighted tardiness problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 232-237, January.
    15. Guajardo, Mario & Kylinger, Martin & Rönnqvist, Mikael, 2013. "Speciality oils supply chain optimization: From a decoupled to an integrated planning approach," European Journal of Operational Research, Elsevier, vol. 229(2), pages 540-551.
    16. Pereira, Daniel Filipe & Oliveira, José Fernando & Carravilla, Maria Antónia, 2020. "Tactical sales and operations planning: A holistic framework and a literature review of decision-making models," International Journal of Production Economics, Elsevier, vol. 228(C).
    17. Ouenniche, J. & Bertrand, J. W. M., 2001. "The finite horizon economic lot sizing problem in job shops: : the multiple cycle approach," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 49-61, December.
    18. Yi Tan & Lars Mönch & John W. Fowler, 2018. "A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines," Journal of Scheduling, Springer, vol. 21(2), pages 209-226, April.
    19. Scott, James A. & Ho, William & Dey, Prasanta K., 2012. "A review of multi-criteria decision-making methods for bioenergy systems," Energy, Elsevier, vol. 42(1), pages 146-156.
    20. Martin Steinrücke & Wolfgang Albrecht, 2016. "A flow-to-equity approach to coordinate supply chain network planning and financial planning with annual cash outflows to an institutional investor," Business Research, Springer;German Academic Association for Business Research, vol. 9(2), pages 297-333, August.

    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:spr:flsman:v:33:y:2021:i:2:d:10.1007_s10696-020-09386-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.