Home > APM>
Biography

Prof. Nodari Vakhania

Georgian Academy of Sciences, Mexico

Professor


Email: nodari@uaem.mx


Qualifications

Ph.D., Russian Academy of Sciences, Russia


Publications (Selected)

  1. N. Vakhania. Fast algorithms for preemptive scheduling of jobs with release times on a single processor to minimize the number of late jobs. Int. J. on Computers Issue 3, Volume 4, 79-87, 2010.
  2. N.Vakhania. A polynomial-time algorithm for a special case of minimizing the lateness on a single machine, Proc. American Conf. Applied Math. (AMERICAN- MATH '10), 2010.
  3. N.Vakhania. Preemptive scheduling of jobs with tied parameters on a single pro- cessor to minimize the number of late jobs, Proc. American Conf. Applied Math.(AMERICAN-MATH '10), 2010.
  4. N. Vakhania. A binary search algorithm for a special case of minimizing thelateness on a single machine. Int. J. of Applied Mathematics and InformaticsIssue 3, Volume 3, 45-50, 2009.
  5. N. Vakhania. Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs. Operations Research Letters 37, 405-410,2009.
  6. N. Vakhania. On common properties of two scheduling problems with di_erent objective criteria. Int. J. of Pure and Applied Mathematics 51, p.157-162, 2009.
  7. N.Vakhania. Fast algorithms for preemptive scheduling of equal-length jobs on a single and identical processors to minimize the number of late jobs. Int. J. of Mathematics and Computers in Simulation 1, p.95-100, 2008.
  8. E. Shchepin and N. Vakhania. On the geometry, preemptions and complexityof multiprocessor and open shop scheduling. Annals of Operations Research 159,p.183-213, 2008.
  9. E.Shchepin and N. Vakhania. On the approximability and complexity of acyclic shop scheduling problems. WSEAS Transactions on Computers 5, p.3139-3145, 2006.
  10. E. Shchepin and N. Vakhania. An absolute approximation algorithm for scheduling unrelated machines. Naval Research Logistics 53, p.502-507, 2006.
  11. E. Shchepin and N. Vakhania. An optimal rounding gives a better approximation for scheduling unrelated machines. Operations Research Letters 33,p.127-133,2005. 

Profile Details

Null