IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v301y2022i1p235-253.html
   My bibliography  Save this article

A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing

Author

Listed:
  • Altekin, F. Tevhide
  • Bukchin, Yossi

Abstract

Additive manufacturing (AM) suggests promising manufacturing technologies, which complement traditional manufacturing in multiple areas, such as biomedical, aerospace, defense, and automotive industries. This paper addresses the production planning problem in multi-machine AM systems. We consider all relevant physical and technological parameters of the machines and the produced parts, for using direct metal laser sintering (DMLS) technology. In DMLS technology, each machine produces jobs, where each job consists of several parts arranged horizontally on the build tray. Starting a new job requires a setup operation. We address the simultaneous assignment of parts to jobs and jobs to the machines, while considering the cost and makespan objectives. A unified mixed-integer linear-programming (MILP) formulation that can minimize the above objectives separately and simultaneously is suggested, along with analytical bounds and valid inequalities. Experimentation demonstrates the effectiveness of the proposed formulation with single objectives versus similar formulations from the literature. An efficient frontier approach is applied to the multi-objective problem while generating a diverse set of exact non-dominated solutions. The trade-off between the objectives is analyzed via experimentation. Results show that when identical machines are used, the trade-off is relatively small, and hence the decision-maker can use any of the single objectives. However, when non-identical machines are used, it is important to consider both objectives simultaneously. Moreover, the trade-off increases with the number of machines and heterogeneity of the system, with respect to the size and settings of the machines.

Suggested Citation

  • Altekin, F. Tevhide & Bukchin, Yossi, 2022. "A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing," European Journal of Operational Research, Elsevier, vol. 301(1), pages 235-253.
  • Handle: RePEc:eee:ejores:v:301:y:2022:i:1:p:235-253
    DOI: 10.1016/j.ejor.2021.10.020
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.ejor.2021.10.020?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. Bogers, Marcel & Hadar, Ronen & Bilberg, Arne, 2016. "Additive manufacturing for consumer-centric business models: Implications for supply chains in consumer goods manufacturing," Technological Forecasting and Social Change, Elsevier, vol. 102(C), pages 225-239.
    2. Clyde L. Monma & Chris N. Potts, 1989. "On the Complexity of Scheduling with Batch Setup Times," Operations Research, INFORMS, vol. 37(5), pages 798-804, October.
    3. Yang, Bibo & Geunes, Joseph, 2008. "Predictive-reactive scheduling on a single resource with uncertain future jobs," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1267-1283, September.
    4. Yossi Luzon & Eugene Khmelnitsky, 2019. "Job sizing and sequencing in additive manufacturing to control process deterioration," IISE Transactions, Taylor & Francis Journals, vol. 51(2), pages 181-191, February.
    5. Jianming Zhang & Xifan Yao & Yun Li, 2020. "Improved evolutionary algorithm for parallel batch processing machine scheduling in additive manufacturing," International Journal of Production Research, Taylor & Francis Journals, vol. 58(8), pages 2263-2282, April.
    6. Westerweel, Bram & Basten, Rob J.I. & van Houtum, Geert-Jan, 2018. "Traditional or Additive Manufacturing? Assessing Component Design Options through Lifecycle Cost Analysis," European Journal of Operational Research, Elsevier, vol. 270(2), pages 570-585.
    7. Griffiths, Valeriya & Scanlan, James P. & Eres, Murat H. & Martinez-Sykora, Antonio & Chinchapatnam, Phani, 2019. "Cost-driven build orientation and bin packing of parts in Selective Laser Melting (SLM)," European Journal of Operational Research, Elsevier, vol. 273(1), pages 334-352.
    8. Herroelen, Willy & Leus, Roel, 2005. "Project scheduling under uncertainty: Survey and research potentials," European Journal of Operational Research, Elsevier, vol. 165(2), pages 289-306, September.
    9. Aytug, Haldun & Lawley, Mark A. & McKay, Kenneth & Mohan, Shantha & Uzsoy, Reha, 2005. "Executing production schedules in the face of uncertainties: A review and some future directions," European Journal of Operational Research, Elsevier, vol. 161(1), pages 86-110, February.
    10. Michael Masin & Yossi Bukchin, 2008. "Diversity Maximization Approach for Multiobjective Optimization," Operations Research, INFORMS, vol. 56(2), pages 411-424, April.
    11. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    12. Li, Xueping & Zhang, Kaike, 2018. "Single batch processing machine scheduling with two-dimensional bin packing constraints," International Journal of Production Economics, Elsevier, vol. 196(C), pages 113-121.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jose M. Framinan & Paz Perez-Gonzalez & Victor Fernandez-Viagas, 2023. "An overview on the use of operations research in additive manufacturing," Annals of Operations Research, Springer, vol. 322(1), pages 5-40, March.

    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. Jose M. Framinan & Paz Perez-Gonzalez & Victor Fernandez-Viagas, 2023. "An overview on the use of operations research in additive manufacturing," Annals of Operations Research, Springer, vol. 322(1), pages 5-40, March.
    2. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.
    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. Marić, Josip & Opazo-Basáez, Marco & Vlačić, Božidar & Dabić, Marina, 2023. "Innovation management of three-dimensional printing (3DP) technology: Disclosing insights from existing literature and determining future research streams," Technological Forecasting and Social Change, Elsevier, vol. 193(C).
    5. Selvarajah, Esaignani & Steiner, George, 2006. "Batch scheduling in a two-level supply chain--a focus on the supplier," European Journal of Operational Research, Elsevier, vol. 173(1), pages 226-240, August.
    6. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    7. Schaller, Jeffrey, 2007. "Scheduling on a single machine with family setups to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 105(2), pages 329-344, February.
    8. Alessandro Druetto & Erica Pastore & Elena Rener, 2023. "Parallel batching with multi-size jobs and incompatible job families," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 440-458, July.
    9. Amir Mokhtari & Jane M. Van Doren, 2019. "An Agent‐Based Model for Pathogen Persistence and Cross‐Contamination Dynamics in a Food Facility," Risk Analysis, John Wiley & Sons, vol. 39(5), pages 992-1021, May.
    10. Trietsch, Dan & Mazmanyan, Lilit & Gevorgyan, Lilit & Baker, Kenneth R., 2012. "Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation," European Journal of Operational Research, Elsevier, vol. 216(2), pages 386-396.
    11. Shichang Xiao & Shudong Sun & Jionghua (Judy) Jin, 2017. "Surrogate Measures for the Robust Scheduling of Stochastic Job Shop Scheduling Problems," Energies, MDPI, vol. 10(4), pages 1-26, April.
    12. Yin, Yunqiang & Luo, Zunhao & Wang, Dujuan & Cheng, T.C.E., 2023. "Wasserstein distance‐based distributionally robust parallel‐machine scheduling," Omega, Elsevier, vol. 120(C).
    13. Öncü Hazir & Gündüz Ulusoy, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," Post-Print hal-02898162, HAL.
    14. Oğuzhan Ahmet Arık, 2022. "Additive manufacturing scheduling problem considering assembly operations of parts," Operational Research, Springer, vol. 22(3), pages 3063-3087, July.
    15. Laslo, Zohar & Golenko-Ginzburg, Dimitri & Keren, Baruch, 2008. "Optimal booking of machines in a virtual job-shop with stochastic processing times to minimize total machine rental and job tardiness costs," International Journal of Production Economics, Elsevier, vol. 111(2), pages 812-821, February.
    16. Xiong, Jian & Xing, Li-ning & Chen, Ying-wu, 2013. "Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns," International Journal of Production Economics, Elsevier, vol. 141(1), pages 112-126.
    17. Dominik Kress & Maksim Barketau & Erwin Pesch, 2018. "Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines," Journal of Scheduling, Springer, vol. 21(6), pages 595-606, December.
    18. Nicholas G. Hall & Chris N. Potts, 2010. "Rescheduling for Job Unavailability," Operations Research, INFORMS, vol. 58(3), pages 746-755, June.
    19. Shi-Sheng Li & Ren-Xia Chen & Qi Feng, 2016. "Scheduling two job families on a single machine with two competitive agents," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 784-799, October.
    20. Chakhlevitch, Konstantin & Glass, Celia A. & Kellerer, Hans, 2011. "Batch machine production with perishability time windows and limited batch size," European Journal of Operational Research, Elsevier, vol. 210(1), pages 39-47, April.

    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:ejores:v:301:y:2022:i:1:p:235-253. 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/eor .

    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.