IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0131003.html
   My bibliography  Save this article

Intelligent Scheduling for Underground Mobile Mining Equipment

Author

Listed:
  • Zhen Song
  • Håkan Schunnesson
  • Mikael Rinne
  • John Sturgul

Abstract

Many studies have been carried out and many commercial software applications have been developed to improve the performances of surface mining operations, especially for the loader-trucks cycle of surface mining. However, there have been quite few studies aiming to improve the mining process of underground mines. In underground mines, mobile mining equipment is mostly scheduled instinctively, without theoretical support for these decisions. Furthermore, in case of unexpected events, it is hard for miners to rapidly find solutions to reschedule and to adapt the changes. This investigation first introduces the motivation, the technical background, and then the objective of the study. A decision support instrument (i.e. schedule optimizer for mobile mining equipment) is proposed and described to address this issue. The method and related algorithms which are used in this instrument are presented and discussed. The proposed method was tested by using a real case of Kittilä mine located in Finland. The result suggests that the proposed method can considerably improve the working efficiency and reduce the working time of the underground mine.

Suggested Citation

  • Zhen Song & Håkan Schunnesson & Mikael Rinne & John Sturgul, 2015. "Intelligent Scheduling for Underground Mobile Mining Equipment," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-21, June.
  • Handle: RePEc:plo:pone00:0131003
    DOI: 10.1371/journal.pone.0131003
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0131003
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0131003&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0131003?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
    ---><---

    References listed on IDEAS

    as
    1. Ruiz, Ruben & Maroto, Concepcion & Alcaraz, Javier, 2005. "Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics," European Journal of Operational Research, Elsevier, vol. 165(1), pages 34-54, August.
    2. Kurz, Mary E. & Askin, Ronald G., 2004. "Scheduling flexible flow lines with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 159(1), pages 66-82, November.
    3. Jin, Zhihong & Yang, Zan & Ito, Takahiro, 2006. "Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 100(2), pages 322-334, April.
    4. Sriskandarajah, C. & Sethi, S. P., 1989. "Scheduling algorithms for flexible flowshops: Worst and average case performance," European Journal of Operational Research, Elsevier, vol. 43(2), pages 143-160, November.
    5. Peter McKenzie & Alexandra M. Newman & Luis Tenorio, 2008. "Front Range Aggregates Optimizes Feeder Movements at Its Quarry," Interfaces, INFORMS, vol. 38(6), pages 436-447, December.
    6. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 1998. "The flow shop with parallel machines: A tabu search approach," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 226-253, April.
    7. F Sivrikaya şerifoğlu & G Ulusoy, 2004. "Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(5), pages 504-512, May.
    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. Akshay Chowdu & Peter Nesbitt & Andrea Brickey & Alexandra M. Newman, 2022. "Operations Research in Underground Mine Planning: A Review," Interfaces, INFORMS, vol. 52(2), pages 109-132, March.
    2. Jie Hou & Guoqing Li & Lianyun Chen & Hao Wang & Nailian Hu, 2022. "Optimization of Truck–Loader Matching Based on a Simulation Method for Underground Mines," Sustainability, MDPI, vol. 15(1), pages 1-14, December.
    3. Siyu Tu & Mingtao Jia & Liguan Wang & Shuzhao Feng & Shuang Huang, 2023. "A Dynamic Scheduling Model for Underground Metal Mines under Equipment Failure Conditions," Sustainability, MDPI, vol. 15(9), pages 1-18, April.
    4. Siyu Tu & Mingtao Jia & Liguan Wang & Shuzhao Feng & Shuang Huang, 2022. "A Multi-Equipment Task Assignment Model for the Horizontal Stripe Pre-Cut Mining Method," Sustainability, MDPI, vol. 14(24), pages 1-18, December.
    5. Chimunhu, Prosper & Topal, Erkan & Ajak, Ajak Duany & Asad, Waqar, 2022. "A review of machine learning applications for underground mine planning and scheduling," Resources Policy, Elsevier, vol. 77(C).

    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. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    2. Quadt, Daniel & Kuhn, Heinrich, 2007. "A taxonomy of flexible flow line scheduling procedures," European Journal of Operational Research, Elsevier, vol. 178(3), pages 686-698, May.
    3. Pan, Quan-Ke & Wang, Ling & Li, Jun-Qing & Duan, Jun-Hua, 2014. "A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation," Omega, Elsevier, vol. 45(C), pages 42-56.
    4. Ruiz, Ruben & Maroto, Concepcion, 2006. "A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility," European Journal of Operational Research, Elsevier, vol. 169(3), pages 781-800, March.
    5. Carlos Paternina-Arboleda & Jairo Montoya-Torres & Milton Acero-Dominguez & Maria Herrera-Hernandez, 2008. "Scheduling jobs on a k-stage flexible flow-shop," Annals of Operations Research, Springer, vol. 164(1), pages 29-40, November.
    6. Quadt, Daniel & Kuhn, Heinrich, 2007. "Batch scheduling of jobs with identical process times on flexible flow lines," International Journal of Production Economics, Elsevier, vol. 105(2), pages 385-401, February.
    7. Chou, Fuh-Der, 2013. "Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks," International Journal of Production Economics, Elsevier, vol. 141(1), pages 137-145.
    8. 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.
    9. Kurz, Mary E. & Askin, Ronald G., 2003. "Comparing scheduling rules for flexible flow lines," International Journal of Production Economics, Elsevier, vol. 85(3), pages 371-388, September.
    10. Kurz, Mary E. & Askin, Ronald G., 2004. "Scheduling flexible flow lines with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 159(1), pages 66-82, November.
    11. Frank Benda & Roland Braune & Karl F. Doerner & Richard F. Hartl, 2019. "A machine learning approach for flow shop scheduling problems with alternative resources, sequence-dependent setup times, and blocking," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 871-893, December.
    12. Lin, Hung-Tso & Liao, Ching-Jong, 2003. "A case study in a two-stage hybrid flow shop with setup time and dedicated machines," International Journal of Production Economics, Elsevier, vol. 86(2), pages 133-143, November.
    13. Bozorgirad, Mir Abbas & Logendran, Rasaratnam, 2013. "Bi-criteria group scheduling in hybrid flowshops," International Journal of Production Economics, Elsevier, vol. 145(2), pages 599-612.
    14. Weng, Wei & Fujimura, Shigeru, 2012. "Control methods for dynamic time-based manufacturing under customized product lead times," European Journal of Operational Research, Elsevier, vol. 218(1), pages 86-96.
    15. Azizoglu, Meral & Cakmak, Ergin & Kondakci, Suna, 2001. "A flexible flowshop problem with total flow time minimization," European Journal of Operational Research, Elsevier, vol. 132(3), pages 528-538, August.
    16. Hoogeveen, J. A. & Lenstra, J. K. & Veltman, B., 1996. "Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard," European Journal of Operational Research, Elsevier, vol. 89(1), pages 172-175, February.
    17. Allaoui, Hamid & Artiba, AbdelHakim, 2009. "Johnson's algorithm: A key to solve optimally or approximately flow shop scheduling problems with unavailability periods," International Journal of Production Economics, Elsevier, vol. 121(1), pages 81-87, September.
    18. Yong Wang & Yuting Wang & Yuyan Han, 2023. "A Variant Iterated Greedy Algorithm Integrating Multiple Decoding Rules for Hybrid Blocking Flow Shop Scheduling Problem," Mathematics, MDPI, vol. 11(11), pages 1-25, May.
    19. Miguel A. Ortíz & Leidy E. Betancourt & Kevin Parra Negrete & Fabio Felice & Antonella Petrillo, 2018. "Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry," Annals of Operations Research, Springer, vol. 264(1), pages 409-433, May.
    20. Weiya Zhong & Yun Shi, 2018. "Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 108-125, January.

    More about this item

    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:plo:pone00:0131003. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.