IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v22y2022i3d10.1007_s12351-021-00649-y.html
   My bibliography  Save this article

Additive manufacturing scheduling problem considering assembly operations of parts

Author

Listed:
  • Oğuzhan Ahmet Arık

    (Nuh Naci Yazgan University)

Abstract

Additive manufacturing (AM) is a candidate to be one of the future general-purpose technologies. AM is called with 3D printing, Rapid Prototyping, Direct Digital Manufacturing, layered manufacturing, and/or additive manufacturing. Today, AM is a tool for producing customized small products with small lot sizes. Tomorrow, it will be possible for AM to enter every home and to be used for general purposes. The literature about AM has focused mainly on the technology to decrease the cost of AM, to increase the speed of AM machines, and to increase the common availability of those machines. There are so few papers investigating AM machines in view of scheduling problems. This paper considers a single AM machine that produces multiple parts in batches and then these parts are assembled to produce desired goods. Most AM machines have limitations because of the area of the machine tray and the height of the machine. Therefore, products are separated into small parts considering the area and height of the machine. Then, these separated small parts are assembled to produce the desired goods. In view of scheduling problems, the proposed problem includes single machine batch scheduling and assembly operations. In this paper, we propose a mixed-integer programming (MIP) model and a fast heuristic method with a simple local search mechanism for the problem. We investigate two cases for the same problem. In the first, we consider only the one-dimensional assignment of parts to baches and we just design our solution approaches to assign parts to the batch, if the total area of parts is less than or equal to the machine tray's area. In the second, we modify our solution approaches to consider parts' lengths and widths while assigning parts to batches in a 2D assignment. In the end, we compare the proposed heuristic with the proposed MIP by using some test problems within time limits for all cases. Experimental results show that the proposed heuristic provides promising results.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:operea:v:22:y:2022:i:3:d:10.1007_s12351-021-00649-y
    DOI: 10.1007/s12351-021-00649-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-021-00649-y
    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/s12351-021-00649-y?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. Kovalyov, M. Y. & Potts, C. N. & Strusevich, V. A., 2004. "Batching decisions for assembly production systems," European Journal of Operational Research, Elsevier, vol. 157(3), pages 620-642, September.
    2. Loukil, Taicir & Teghem, Jacques & Fortemps, Philippe, 2007. "A multi-objective production scheduling case study solved by simulated annealing," European Journal of Operational Research, Elsevier, vol. 179(3), pages 709-722, June.
    3. 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.
    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. Zahra Tajbakhsh & Parviz Fattahi & Javad Behnamian, 2014. "Multi-objective assembly permutation flow shop scheduling problem: a mathematical model and a meta-heuristic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(10), pages 1580-1592, October.
    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. 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.
    2. Framinan, Jose M. & Perez-Gonzalez, Paz & Fernandez-Viagas, Victor, 2019. "Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures," European Journal of Operational Research, Elsevier, vol. 273(2), pages 401-417.
    3. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    4. Luo, Hao & Du, Bing & Huang, George Q. & Chen, Huaping & Li, Xiaolin, 2013. "Hybrid flow shop scheduling considering machine electricity consumption cost," International Journal of Production Economics, Elsevier, vol. 146(2), pages 423-439.
    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. Jiae Zhang & Jianjun Yang, 2016. "Flexible job-shop scheduling with flexible workdays, preemption, overlapping in operations and satisfaction criteria: an industrial application," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4894-4918, August.
    7. Zhang, Sicheng & Li, Xiang & Zhang, Bowen & Wang, Shouyang, 2020. "Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system," European Journal of Operational Research, Elsevier, vol. 283(2), pages 441-460.
    8. Jose L. Andrade-Pineda & David Canca & Pedro L. Gonzalez-R & M. Calle, 2020. "Scheduling a dual-resource flexible job shop with makespan and due date-related criteria," Annals of Operations Research, Springer, vol. 291(1), pages 5-35, August.
    9. 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.
    10. Zhou, Feng & Blocher, James D. & Hu, Xinxin & Sebastian Heese, H., 2014. "Optimal single machine scheduling of products with components and changeover cost," European Journal of Operational Research, Elsevier, vol. 233(1), pages 75-83.
    11. Z.H. Che, 2012. "A hybrid algorithm for fuzzy clustering," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 6(1), pages 50-67.
    12. Jae Won Jang & Yong Jae Kim & Byung Soo Kim, 2022. "A Three-Stage ACO-Based Algorithm for Parallel Batch Loading and Scheduling Problem with Batch Deterioration and Rate-Modifying Activities," Mathematics, MDPI, vol. 10(4), pages 1-26, February.
    13. Hu, Mengqi & Weir, Jeffery D. & Wu, Teresa, 2012. "Decentralized operation strategies for an integrated building energy system using a memetic algorithm," European Journal of Operational Research, Elsevier, vol. 217(1), pages 185-197.
    14. F. Hwang & M. Kovalyov & B. Lin, 2014. "Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence," Annals of Operations Research, Springer, vol. 217(1), pages 263-279, June.
    15. 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.
    16. Dauzère-Pérès, Stéphane & Ding, Junwen & Shen, Liji & Tamssaouet, Karim, 2024. "The flexible job shop scheduling problem: A review," European Journal of Operational Research, Elsevier, vol. 314(2), pages 409-432.
    17. Tamssaouet, Karim & Dauzère-Pérès, Stéphane & Knopp, Sebastian & Bitar, Abdoul & Yugma, Claude, 2022. "Multiobjective optimization for complex flexible job-shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 296(1), pages 87-100.
    18. Xiaoyu Yu & Jingyi Qian & Yajing Zhang & Min Kong, 2023. "Supply Chain Scheduling Method for the Coordination of Agile Production and Port Delivery Operation," Mathematics, MDPI, vol. 11(15), pages 1-24, July.
    19. Wang, Mengyao & Zhou, Chenhao & Wang, Aihu, 2022. "A cluster-based yard template design integrated with yard crane deployment using a placement heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    20. Fitouhi, Mohamed-Chahir & Nourelfath, Mustapha, 2014. "Integrating noncyclical preventive maintenance scheduling and production planning for multi-state systems," Reliability Engineering and System Safety, Elsevier, vol. 121(C), pages 175-186.

    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:operea:v:22:y:2022:i:3:d:10.1007_s12351-021-00649-y. 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.