IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v120y2023ics0305048323000828.html
   My bibliography  Save this article

A real-world case of autoclave loading and scheduling problems in aerospace composite material production

Author

Listed:
  • Haskilic, Volkan
  • Ulucan, Aydin
  • Atici, Kazim Baris
  • Sarac, Seda Busra

Abstract

Due to their high initial investment costs, and excessive energy consumption, autoclaves are costly pieces of machinery to operate in manufacturing composite materials. They play a critical role in the process since they feed the subsequent processes. For more effective autoclave operations, careful planning is necessary to decide what and when to load. Accordingly, the current research deals with a real-world case of autoclave loading and scheduling problems in a large-scale facility in an aerospace company. We introduce a single mixed-integer quadratically constrained programming to solve the facility's loading (bin-packing) and scheduling problems simultaneously. We utilize real-world data under different scenarios of changing the number of autoclaves and fixtures (tools that the prepared materials are laid on before entering the autoclave). Moreover, we present and test a two-stage approach to the same problem in that two main components are considered consecutively for faster solutions. Both single and two-stage approaches to the problem are elaborated along with their benefits and drawbacks. Nevertheless, the results of both methods reveal that the facility has a significant amount of saving potential. We also determine that a better course of action to improve the company's ability to meet demand would be to direct future investments towards fixtures rather than new autoclaves.

Suggested Citation

  • Haskilic, Volkan & Ulucan, Aydin & Atici, Kazim Baris & Sarac, Seda Busra, 2023. "A real-world case of autoclave loading and scheduling problems in aerospace composite material production," Omega, Elsevier, vol. 120(C).
    • Handle: RePEc:eee:jomega:v:120:y:2023:i:c:s0305048323000828
    DOI: 10.1016/j.omega.2023.102918
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048323000828
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2023.102918?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. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    2. Husseinzadeh Kashan, Ali & Ozturk, Onur, 2022. "Improved MILP formulation equipped with valid inequalities for scheduling a batch processing machine with non-identical job sizes," Omega, Elsevier, vol. 112(C).
    3. Christian Hueber & Gudrun Fischer & Nikolaus Schwingshandl & Ralf Schledjewski, 2019. "Production planning optimisation for composite aerospace manufacturing," International Journal of Production Research, Taylor & Francis Journals, vol. 57(18), pages 5857-5873, September.
    4. 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.
    5. Heuser, Patricia & Tauer, Björn, 2023. "Single-machine scheduling with product category-based learning and forgetting effects," Omega, Elsevier, vol. 115(C).
    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. Lin, Ran & Wang, Jun-Qiang & Oulamara, Ammar, 2023. "Online scheduling on parallel-batch machines with periodic availability constraints and job delivery," Omega, Elsevier, vol. 116(C).
    2. Lin, Ran & Wang, Jun-Qiang & Liu, Zhixin & Xu, Jun, 2023. "Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions," European Journal of Operational Research, Elsevier, vol. 309(1), pages 53-64.
    3. Tian, Zheng & Zheng, Li, 2024. "Single machine parallel-batch scheduling under time-of-use electricity prices: New formulations and optimisation approaches," European Journal of Operational Research, Elsevier, vol. 312(2), pages 512-524.
    4. Yin, Yunqiang & Luo, Zunhao & Wang, Dujuan & Cheng, T.C.E., 2023. "Wasserstein distance‐based distributionally robust parallel‐machine scheduling," Omega, Elsevier, vol. 120(C).
    5. Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.
    6. Ma, Shuaiyin & Ding, Wei & Liu, Yang & Ren, Shan & Yang, Haidong, 2022. "Digital twin and big data-driven sustainable smart manufacturing based on information management systems for energy-intensive industries," Applied Energy, Elsevier, vol. 326(C).
    7. Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian, 2022. "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1512-1530, May.
    8. Ou, Jinwen & Lu, Lingfa & Zhong, Xueling, 2023. "Parallel-batch scheduling with rejection: Structural properties and approximation algorithms," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1017-1032.
    9. Yoshiaki Inoue, 2022. "A load-balancing problem for distributed bulk-service queues with size-dependent batch processing times," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 449-451, April.
    10. Husseinzadeh Kashan, Ali & Ozturk, Onur, 2022. "Improved MILP formulation equipped with valid inequalities for scheduling a batch processing machine with non-identical job sizes," Omega, Elsevier, vol. 112(C).
    11. Xia Qian & Zhang Xingong, 2023. "Online scheduling of two-machine flowshop with lookahead and incompatible job families," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-11, January.
    12. Ma, Shuaiyin & Huang, Yuming & Liu, Yang & Kong, Xianguang & Yin, Lei & Chen, Gaige, 2023. "Edge-cloud cooperation-driven smart and sustainable production for energy-intensive manufacturing industries," Applied Energy, Elsevier, vol. 337(C).
    13. Zhang, Han & Li, Kai & Jia, Zhao-hong & Chu, Chengbin, 2023. "Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1024-1046.

    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:jomega:v:120:y:2023:i:c:s0305048323000828. 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/375/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.