IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i16p2621-d1725390.html
   My bibliography  Save this article

Automated and Optimized Scheduling for CNC Machines

Author

Listed:
  • Guilherme Sousa Silva Martins

    (Centre of Mathematics, University of Minho, 4710-057 Braga, Portugal)

  • M. Fernanda P. Costa

    (Centre of Mathematics, University of Minho, 4710-057 Braga, Portugal)

  • Filipe Alves

    (DTx—Digital Transformation CoLAB, University of Minho, 4800-058 Guimarães, Portugal)

Abstract

This work presents the design and implementation of an automated, digital, and modular system to address a real-world industrial challenge: the automation and optimization of production schedules for Computer Numerical Control (CNC) machines in a factory in Portugal. The goal is to replicate and enhance the existing manual scheduling process by integrating multiple data sources and formulating a general Mixed-Integer Linear Programming (MILP) model with constraints. This model can be solved using MILP optimization methods to produce efficient scheduling solutions that minimize machine downtime, reduce tool change frequency, and lower operator workload. The proposed system is implemented using open-source Python abstraction interfaces (Python-MIP), employing state-of-the-art of MILP optimization solvers such as CBC and HiGHS for solution validation. The system is designed to accommodate a wide range of constraints and operational factors, which can be switched on or off as needed, thereby enhancing its flexibility and decision-support capabilities. Additionally, a user-friendly graphical application is developed to facilitate the input of specific scheduling data and constraints, enabling flexible and efficient formulation of diverse scheduling scenarios. The proposed system is validated through multiple case studies, demonstrating its effectiveness in optimizing industrial CNC scheduling tasks and providing a scalable, practical tool for real-world factory operations.

Suggested Citation

  • Guilherme Sousa Silva Martins & M. Fernanda P. Costa & Filipe Alves, 2025. "Automated and Optimized Scheduling for CNC Machines," Mathematics, MDPI, vol. 13(16), pages 1-20, August.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:16:p:2621-:d:1725390
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/16/2621/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/16/2621/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Peter Brucker, 2007. "Scheduling Algorithms," Springer Books, Springer, edition 0, number 978-3-540-69516-5, December.
    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. Vincent T’kindt & Federico Della Croce & Mathieu Liedloff, 2022. "Moderate exponential-time algorithms for scheduling problems," 4OR, Springer, vol. 20(4), pages 533-566, December.
    2. Talebiyan, Hesam & Dueñas-Osorio, Leonardo, 2023. "Auctions for resource allocation and decentralized restoration of interdependent networks," Reliability Engineering and System Safety, Elsevier, vol. 237(C).
    3. Yakov Zinder & Alexandr Kononov & Joey Fung, 2021. "A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements," Journal of Combinatorial Optimization, Springer, vol. 42(2), pages 276-309, August.
    4. Novak, Antonin & Gnatowski, Andrzej & Sucha, Premysl, 2022. "Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations," European Journal of Operational Research, Elsevier, vol. 302(2), pages 438-455.
    5. Li-on Raviv & Amir Leshem, 2019. "Scheduling for Multi-User Multi-Input Multi-Output Wireless Networks with Priorities and Deadlines," Future Internet, MDPI, vol. 11(8), pages 1-20, August.
    6. Brachmann, Robert & Kolisch, Rainer, 2021. "The impact of flexibility on engineer-to-order production planning," International Journal of Production Economics, Elsevier, vol. 239(C).
    7. Yanıkoğlu, İhsan & Yavuz, Tonguc, 2022. "Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 301(3), pages 875-895.
    8. Bock, Felix & Bruhn, Henning, 2021. "Case study on scheduling cyclic conveyor belts," Omega, Elsevier, vol. 102(C).
    9. Sha, Yue & Zhang, Junlong & Cao, Hui, 2021. "Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties," European Journal of Operational Research, Elsevier, vol. 290(3), pages 886-900.
    10. Vincent T’kindt & Federico Della Croce & Mathieu Liedloff, 2024. "Moderate exponential-time algorithms for scheduling problems," Annals of Operations Research, Springer, vol. 343(2), pages 753-783, December.
    11. de Weerdt, Mathijs & Baart, Robert & He, Lei, 2021. "Single-machine scheduling with release times, deadlines, setup times, and rejection," European Journal of Operational Research, Elsevier, vol. 291(2), pages 629-639.
    12. Branislav Micieta & Jolanta Staszewska & Matej Kovalsky & Martin Krajcovic & Vladimira Binasova & Ladislav Papanek & Ivan Antoniuk, 2021. "Innovative System for Scheduling Production Using a Combination of Parametric Simulation Models," Sustainability, MDPI, vol. 13(17), pages 1-20, August.
    13. Shibasaki, Rui S. & Rossi, André & Gurevsky, Evgeny, 2024. "A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty," European Journal of Operational Research, Elsevier, vol. 313(3), pages 1015-1030.
    14. Raphael Kühn & Christian Weiß & Heiner Ackermann & Sandy Heydrich, 2024. "Scheduling a single machine with multiple due dates per job," Journal of Scheduling, Springer, vol. 27(6), pages 565-585, December.

    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:gam:jmathe:v:13:y:2025:i:16:p:2621-:d:1725390. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.