Tanka Nath Dhamala
Copyright © 2018
  1. Home
  2. Teaching and Research
  3. Research Group/Students

Research Group/Students

Dissertation/Thesis (Completed and in Progress)

Doctor of Philosophy  
  1. Dr. Shree Ram Khadka, Central Department of Mathematics, TU, Nepal, Mixed-Model Just-in-Time Sequencing Problem  (January 27, 2012).
  2. Dr. Gyan Bahadur Thapa, Institute of Engineering, TU, Nepal (Characterizations of Just-in Time Sequencing Problems with Apportionment and Supply Chain (December 28, 2013).
  3. Dr. Urmila Pyakurel, Central Department of Mathematics, TU, Nepal (Evacuation Planning Problem with Contraflow Approach) (March 4, 2016).
  4. Mr. Ram Chandra Dhungana, Central Department of Mathematics, TU, Nepal (Efficient Dynamic Flow Algorithms for Evacuation Planning) (in progress).
  5. Mr. Iswar Mani Adhikari, Central Department of Mathematics, TU, Nepal (Evacuation Optimization with Minimum Clearance Time) (in progress).
  6. Mr. Hari Nandan Nath,Central Department of Mathematics, TU, Nepal (Optimization Models and Algorithms for Evacuation Planning) (in progress).
  7. (with Dr. Urmila Pyakurel) Mr. Shiva Prasad Gupta, Central Department of Mathematics, TU, Nepal (Models and Algorithms for Flow Over Time Problems) (in progress, since 2017).

Master of Philosophy 
  1. Shiva Prakash Gupta, Central Department of Mathematics, TU, Nepal, Earliest Arrival of Evacuees with Contraflow Approach (March, 2016).

Master's Thesis
 
  1. Komal Raj Joshi (CDM, 2014), Contraflow Optimization for Evacuation Planning. 
  2. Ajit Poudel (CDM, 2014), Earliest Arrival Flows in Discrete Dynamic Network.
  3. Sanat Kumar Acharya (CDM, 2014), Earliest Arrival Flows in Dynamic Network.
  4.  Ram Chandra Dhaungana (CDM 2014), Efficient Algorithm on Universally Maximum Contraflow.
  5.  JnaneshwarChalise (CDM, 2014), A Study of Earliest Arrival Flow on Series Parallel Graphs
  6.  Rajendra Joshi (CDCSIT, 2013), Metaheuristic solutions to the Response Time Variability Problem.
  7.  Rabi K.C. (CDM, 2013), Integrated Scheduling Location Problems with Makespan Objectives.
  8.  Prava Shrestha (CDM, 2013), Integrated Scheduling Location Problem with Sum Objectives.
  9.  Min Bd. Rana (with S.R. Khadka) (CDM, 2012), Evacuation Planning and Contraflow Network.
  10.  R.K. Dahal (CDCSIT, 2012), Performance Analysis of Hash Message Digests SHA-2 and SHA-3 Finalists.
  11.  Tej Bd. Shahi (CDCSIT, 2012), Support Vector Machine Based Part of Speech Tagging for Nepali Text.
  12.  Bal Krishna Subedi (CDCSIT, 2012), Minimizing the Evacuation Time of Traffic Management Systems Using Simulated Annealing Algorithm.
  13.  Nanda Kishor Roy (CDCSIT, 2012), Improved Multi-Start Method for Solving the Response Time Variability Problem.
  14.  Prem Prasai (CDM, 2012), On the Stability Analysis of Open Shop Sequences with Bounded Processing Times.
  15.  J. Joshi (CDCSIT, 2012), Heuristic Solution to Single Machine Scheduling Problem to Minimize Total Completion Time.
  16.  Narendra Bohara (CDCSIT, 2012), Implementing Key Establishment Protocol for Secure System.
  17.  Paneru (CDCSIT, 2011), Symmetric encryption algorithm using code reuse technique for authentication based on Needham Schoeders protocol.
  18.  L. Joshi (CDCSIT, 2010), A computational analysis of balanced sequences for JIT optimization problems.
  19.  Puja Bhatt (CDCSIT, 2010), Scheduling jobs on a single machine to minimize the number of tardy jobs with release with time constraints.
  20.  R.P. Bhusal (CDM, 2010), Irreducibility of open shop scheduling problems.
  21.  Deepak Babu Amgain (CDM, 2010), On the structural analysis of shop scheduling problems: algebraic characterizations and potential optimality.
  22.  M. Bdr. Khadka (CDCSIT, 2009), An efficient algorithm for mixed model just-in-time production system with chain constraints.
  23.  T. Pd. Paneru (CDM, 2009), Sequencing approaches to the product rate variation problem.
  24.  P. Bhatta (CDCSIT, 2009), On the cyclic sequences in mixed model JIT production system.
  25.  B. Pandey (CDCSIT, 2009), Cyclic sequences for min-max objective in mixed model JIT production system.
  26.  N.Regmi (CDCSIT, 2008), Evaluating heuristic solutions for NP-hard single machine scheduling problems.
  27.  D. Pandey (CDCSIT, 2008), On the solvability and implementation of mixed model JIT production system.
  28.  C.M. Poudyal (CDM, 2008), Bottleneck just-in-time sequencing for mixed-model production systems.
  29.  D. Poudyal (CDM, 2008), Open shop scheduling problems with unit processing times.
  30.  M. Joshi (CDM, 2008), Open shop scheduling problems with arbitrary processing times.
  31.  U. Pyakurel (CDM, 2008), On the solvability of open shop scheduling problems.
  32.  Y.R. Pant (CDM, 2008), On the relations between the optimal solutions of product rate variation problem with different objectives.
  33.  B. Gautam (CDCSIT, 2004), Complexity analysis of open shop scheduling problems.
  34.  Mulepati (CDCSIT, 2004), Computational complexity analysis of job shop scheduling problems.