Professor Mohan Krishnamoorthy

PVC (Research Partnerships)

Office of the Pro-Vice-Chancellor (Research Partnerships)
m.krishnamoorthy@uq.edu.au
+61 7 336 53609

Overview

Professor of Operations Research in the School of Information Technology and Electrical Engineering

Prof. Mohan Krishnamoorthy is Professor of Operations Research at ITEE, UQ and Pro Vice-Chancellor (Research Partnerships) at UQ. Prior to joining UQ Mohan Krishnamoorthy was Pro Vice-Chancellor (Industry Partnerships) at Monash University and was Professor of Operations Research in the School of Mechanical and Aerospace Engineering, Monash Uni. Prior to that, he was CEO of the IITB-Monash Research Academy, a joint-venture research academy between Monash University and Indian Institute of Technology, Bombay. Before that, Mohan Krishnamoorthy was the Associate Dean Research, Faculty of Engineering (Monash) and before that, from 1992, he was at CSIRO. He obtained his PhD from Imperial College, London and taught at the University of Kent, Canterbury before moving to Australia in 1992.

Mohan’s research interests lie in the field of integer/combinatorial optimization. He works on (and has published several papers in) areas and problems such as hub location, rostering, personnel task scheduling, machine scheduling, transportation and port logistics.

Qualifications

  • MSc Operations Research, Delhi University.
  • MSc Management Science, Imperial College London.
  • Ph,D Operations Research, Imperial College London.

Mohan’s Current research interests

  • algorithms for variants of fixed interval scheduling problems.
  • algorithms for scheduling with sequence dependent processing times.
  • optimal content placementry for large scale VoD systems.
  • optimising container terminal operations.
  • solving variants of hub location models.
  • multiprocessor task scheduling.
  • personnel scheduling and rostering.
  • decomposition algorithms.

Research Interests

  • location-allocation network design problems
    hub location problems, container allocation problems, container scheduling problem, data location problems, communications network design problems
  • rostering problems
    fixed roster design, flexible roster design
  • fixed interval scheduling
    scheduling with sequence dependent processing times

Qualifications

  • MSc, Operational Research, University of Delhi
  • MSc, DIC in Management Science, The Imperial College of Science, Technology and Medicine
  • PhD in Operations Research, The Imperial College of Science, Technology and Medicine

Publications

View all Publications

Available Projects

  • The problem is one of locating VOD data in large networks. How do we do this efficiently? What are the difficulties in locating data efficiently to ensure minimal latency and low cost.

  • The problem is one of combining very large neighbourhood search heuristics with decomposition methods and lazy constraints to develop efficient algorithms to solve very large combinatorial optimisation problems.

View all Available Projects

Publications

Book Chapter

Journal Article

Conference Publication

  • Shrivastava, Himanshu, Dutta, Pankaj, Krishnamoorthy, Mohan and Suryawanshi, Pravin (2018). Facility location and distribution planning in a disrupted supply chain. In: Samarjit Kar, Ujjwal Maulik and Xiang Li, Operations Research and Optimization - FOTA 2016. 1st International Conference on Frontiers in Optimization: Theory and Applications, FOTA 2016, Kolkatta, India, (269-284). 24-26 November 2016. doi:10.1007/978-981-10-7814-9_19

  • Mokhtar, Hamid, Krishnamoorthy, Mohan and Ernst, Andreas T. (2017). A modified Benders method for the single- and multiple allocation p-hub median problem. In: Operations Research Proceedings 2017. Annual International Conference of the German Operations Research Society (GOR), Berlin, Germany, (135-141). 6-8 September 2017. doi:10.1007/978-3-319-89920-6_19

  • Mokhtar, Hamid, Krishnamoorthy, Mohan and Ernst, Andreas T. (2017). A new Benders decomposition acceleration procedure for large scale multiple allocation hub location problems. In: 22nd International Congress on Modelling and Simulation Proceedings. 22nd International Congress on Modelling and Simulation, Hobart, Australia, (340-346). 3-8 December 2017.

  • Shrivastava, Himanshu, Dutta, Pankaj, Krishnamoorthy, Mohan and Suryawanshi, Pravin (2017). Designing a Resilient Supply Chain Network for Perishable Products with Random Disruptions. In: Proceedings of the International MultiConference of Engineers and Computer Scientists 2017, IMECS 2017. 2017 International MultiConference of Engineers and Computer Scientists, IMECS 2017, Hong Kong, , (870-875). March 15, 2017-March 17, 2017.

  • Dayama, Niraj Ramesh and Krishnamoorthy, Mohan (2016). Facility location and routing decisions for a food delivery network. In: 2016 International Conference on Industrial Engineering and Engineering Management, IEEM 2016. 2016 International Conference on Industrial Engineering and Engineering Management, IEEM 2016, Bali, , (94-98). December 4, 2016-December 7, 2016. doi:10.1109/IEEM.2016.7797843

  • Kulkarni, S., Ernst, A. T., Ranade, A. and Krishnamoorthy, M. (2016). A Linear Programming Based Iterative Heuristic for the Recreational Vehicle Scheduling Problem. In: 2016 IEEE International Conference On Industrial Engineering and Engineering Management (IEEM). IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Bali, Indonesia, (784-788). 4-7 December 2016. doi:10.1109/IEEM.2016.7797983

  • Baatar, Davaatseren, Krishnamoorthy, Mohan and Ernst, Andreas T. (2015). A Triplet-Based exact method for the shift minimisation personnel task scheduling problem. In: Nikhil Bansal and Irene Finocchi, 23rd Annual European Symposium on Algorithms (ESA) as part of ALGO Conference, Patras, Greece, (59-70). 14-16 September 2015. doi:10.1007/978-3-662-48350-3_6

  • Bhamare, Deval, Gumaste, Ashwin, Srivastava, Prachi and Krishnamoorthy, Mohan (2013). Multi-layer optimization for service provider transport networks. In: Proceedings of the 2013 38Th Annual Ieee Conference On Local Computer Networks (Lcn 2013). 38th Annual IEEE Conference on Local Computer Networks (LCN), Sydney, NSW, Australia, (695-698). 21 - 24 October 2013. doi:10.1109/LCN.2013.6761313

  • Shankar, Anjana, Bhamare, Deval, Krishnamoorthy, Mohan and Gumaste, Ashwin (2013). Optimizing transport technology choices for Virtual Machines (VMs)in data-center and cloud environments. In: , , (). . doi:10.1109/NCC.2013.6488026

  • Boland, N, Krishnamoorthy, M, Ernst, AT and Ebery, J (2004). Preprocessing and cutting for multiple allocation hub location problems. In: , , (638-653). . doi:10.1016/S0377-2217(03)00072-9

  • Ernst, AT, Jiang, H, Krishnamoorthy, M and Sier, D (2004). Staff scheduling and rostering: A review of applications, methods and models. In: , , (3-27). . doi:10.1016/S0377-2217(03)00095-X

  • Barker, Geoff, Brinschwitz, Kurt, Krishnamoorthy, Mohan and Mills, Graham (1994). Maximizing the value of multi-field developments. In: Proceedings of the Asia Pacific Oil & Gas Conference, , , (485-494). November 7, 1994-November 10, 1994.

  • Krishnamoorthy, M., Mills, G. and Sier, D. (1993). Stockpile planning at Dampier salt W.A. In: Proceedings of the 1993 National Conference on Bulk Materials Handling, , , (73-81). September 22, 1993-September 25, 1993.

Possible Research Projects

Note for students: The possible research projects listed on this page may not be comprehensive or up to date. Always feel free to contact the staff for more information, and also with your own research ideas.

  • The problem is one of locating VOD data in large networks. How do we do this efficiently? What are the difficulties in locating data efficiently to ensure minimal latency and low cost.

  • The problem is one of combining very large neighbourhood search heuristics with decomposition methods and lazy constraints to develop efficient algorithms to solve very large combinatorial optimisation problems.