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

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

Journal Article

Conference Publication

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.