IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v27y2024i5d10.1007_s10951-024-00809-w.html
   My bibliography  Save this article

Production scheduling decision-making technology for multiple CNC machining centers with constraints on serviceable time

Author

Listed:
  • Jianzhong Qiu

    (Qilu University of Technology (Shandong Academy of Sciences))

  • Jun Wu

    (Qilu University of Technology (Shandong Academy of Sciences))

  • Xi Chen

    (Qilu University of Technology (Shandong Academy of Sciences))

  • Bingyan Zhao

    (Qilu University of Technology (Shandong Academy of Sciences))

  • Yan Fang

    (Qilu University of Technology (Shandong Academy of Sciences))

Abstract

The tool’s life statistics module in CNC machining centers typically associates tool’s usage time with the program’s running duration, leading to the tool idle time being logged as a loss in tool life. This often triggers premature tool replacements. To enhance scheduling accuracy across multiple machining centers, we leverage spindle current variations to discern between tool loads and idle periods. Initially, real-time data from the machining center was gathered, and we employed the three-parameter Weibull Distribution method, using 1.351 (A) as the threshold to distinguish between idle and loaded tool states. Subsequently, we proposed a refined method to calculate the tool’s available time, enabling a more precise estimation of its remaining operational lifespan. We further devised a scheduling approach for multiple CNC machining centers based on the tool’s availability time. Ultimately, empirical trials exhibited a 10% increase in average cutting tool utilization efficiency and a 12.5% enhancement in machining center productivity.

Suggested Citation

  • Jianzhong Qiu & Jun Wu & Xi Chen & Bingyan Zhao & Yan Fang, 2024. "Production scheduling decision-making technology for multiple CNC machining centers with constraints on serviceable time," Journal of Scheduling, Springer, vol. 27(5), pages 441-459, October.
    • Handle: RePEc:spr:jsched:v:27:y:2024:i:5:d:10.1007_s10951-024-00809-w
    DOI: 10.1007/s10951-024-00809-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-024-00809-w
    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/s10951-024-00809-w?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. Joseph Leung & Haibing Li & Michael Pinedo, 2008. "Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time," Annals of Operations Research, Springer, vol. 159(1), pages 107-123, March.
    2. Chen, Lin & Ye, Deshi & Zhang, Guochuan, 2018. "Parallel machine scheduling with speed-up resources," European Journal of Operational Research, Elsevier, vol. 268(1), pages 101-112.
    3. Fanjul-Peyro, Luis & Perea, Federico & Ruiz, Rubén, 2017. "Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources," European Journal of Operational Research, Elsevier, vol. 260(2), pages 482-493.
    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. Bentao Su & Naiming Xie & Yingjie Yang, 2021. "Hybrid genetic algorithm based on bin packing strategy for the unrelated parallel workgroup scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 32(4), pages 957-969, April.
    2. Geurtsen, M. & Didden, Jeroen B.H.C. & Adan, J. & Atan, Z. & Adan, I., 2023. "Production, maintenance and resource scheduling: A review," European Journal of Operational Research, Elsevier, vol. 305(2), pages 501-529.
    3. Jartnillaphand, Ponpot & Mardaneh, Elham & Bui, Hoa T., 2025. "Bilinear branch and check for unspecified parallel machine scheduling with shift consideration," European Journal of Operational Research, Elsevier, vol. 320(1), pages 35-56.
    4. Ali Kordmostafapour & Javad Rezaeian & Iraj Mahdavi & Mahdi Yar Farjad, 2022. "Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1438-1470, December.
    5. Norelhouda Sekkal & Fayçal Belkaid, 0. "A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-37.
    6. Yepes-Borrero, Juan C. & Perea, Federico & Ruiz, Rubén & Villa, Fulgencia, 2021. "Bi-objective parallel machine scheduling with additional resources during setups," European Journal of Operational Research, Elsevier, vol. 292(2), pages 443-455.
    7. Perea, Federico & Yepes-Borrero, Juan C. & Menezes, Mozart B.C., 2023. "Acceptance Ordering Scheduling Problem: The impact of an order-portfolio on a make-to-order firm’s profitability," International Journal of Production Economics, Elsevier, vol. 264(C).
    8. Framinan, Jose M. & Perez-Gonzalez, Paz, 2018. "Order scheduling with tardiness objective: Improved approximate solutions," European Journal of Operational Research, Elsevier, vol. 266(3), pages 840-850.
    9. Wang Hong Li & Liang Liang & Sonia Valeria Avilés-Sacoto & Raha Imanirad & Wade D. Cook & Joe Zhu, 2017. "Modeling efficiency in the presence of multiple partial input to output processes," Annals of Operations Research, Springer, vol. 250(1), pages 235-248, March.
    10. Lung-Yu Li & Jian-You Xu & Shuenn-Ren Cheng & Xingong Zhang & Win-Chin Lin & Jia-Cheng Lin & Zong-Lin Wu & Chin-Chia Wu, 2022. "A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment," Mathematics, MDPI, vol. 10(21), pages 1-22, November.
    11. Fan, Jiaxin & Zhang, Chunjiang & Yang, Fajun & Shen, Weiming & Gao, Liang, 2024. "A matheuristic with re-lot-sizing strategies for flexible job-shop rescheduling problem with lot-streaming and machine reconfigurations," European Journal of Operational Research, Elsevier, vol. 319(3), pages 747-762.
    12. Bruno de Athayde Prata & Levi Ribeiro Abreu & José Ytalo Ferreira Lima, 2021. "Heuristic methods for the single-machine scheduling problem with periodical resource constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 524-546, July.
    13. Mohammad Reza Bazargan-Lari & Sharareh Taghipour & Arash Zaretalab & Mani Sharifi, 2022. "Production scheduling optimization for parallel machines subject to physical distancing due to COVID-19 pandemic," Operations Management Research, Springer, vol. 15(1), pages 503-527, June.
    14. Julius Hoffmann & Janis S. Neufeld & Udo Buscher, 2024. "Minimizing the earliness–tardiness for the customer order scheduling problem in a dedicated machine environment," Journal of Scheduling, Springer, vol. 27(6), pages 525-543, December.
    15. Yantong Li & Jean-François Côté & Leandro Callegari-Coelho & Peng Wu, 2022. "Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1048-1069, March.
    16. Prahalad Venkateshan & Joseph Szmerekovsky & George Vairaktarakis, 2020. "A cutting plane approach for the multi-machine precedence-constrained scheduling problem," Annals of Operations Research, Springer, vol. 285(1), pages 247-271, February.
    17. Fleszar, Krzysztof & Hindi, Khalil S., 2018. "Algorithms for the unrelated parallel machine scheduling problem with a resource constraint," European Journal of Operational Research, Elsevier, vol. 271(3), pages 839-848.
    18. Parreño, F. & Alvarez-Valdes, R., 2021. "Mathematical models for a cutting problem in the glass manufacturing industry," Omega, Elsevier, vol. 103(C).
    19. Radosław Rudek, 2012. "Scheduling problems with position dependent job processing times: computational complexity results," Annals of Operations Research, Springer, vol. 196(1), pages 491-516, July.
    20. Hesham K. Alfares, 2022. "Plant shutdown maintenance workforce team assignment and job scheduling," Journal of Scheduling, Springer, vol. 25(3), pages 321-338, June.

    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:jsched:v:27:y:2024:i:5:d:10.1007_s10951-024-00809-w. 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.